/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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:09:32,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:09:32,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:09:32,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:09:32,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:09:32,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:09:32,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:09:32,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:09:32,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:09:32,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:09:32,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:09:32,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:09:32,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:09:32,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:09:32,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:09:32,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:09:32,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:09:32,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:09:32,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:09:32,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:09:32,578 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:09:32,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:09:32,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:09:32,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:09:32,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:09:32,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:09:32,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:09:32,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:09:32,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:09:32,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:09:32,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:09:32,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:09:32,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:09:32,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:09:32,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:09:32,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:09:32,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:09:32,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:09:32,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:09:32,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:09:32,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:09:32,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:09:32,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:09:32,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:09:32,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:09:32,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:09:32,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:09:32,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:09:32,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:09:32,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:09:32,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:09:32,612 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:09:32,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:09:32,612 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:09:32,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:09:32,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:09:32,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:09:32,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:09:32,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:09:32,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:09:32,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:09:32,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:09:32,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:09:32,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:09:32,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:09:32,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:09:32,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:09:32,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:32,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:09:32,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:09:32,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:09:32,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:09:32,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:09:32,615 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:09:32,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:09:32,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:09:32,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:09:32,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:09:32,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:09:32,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:09:32,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:09:32,863 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:09:32,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2022-04-27 15:09:32,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008705c78/e4ca73063f734fb1ad56bd2a152b347f/FLAG8dcf86d0b [2022-04-27 15:09:33,322 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:09:33,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2022-04-27 15:09:33,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008705c78/e4ca73063f734fb1ad56bd2a152b347f/FLAG8dcf86d0b [2022-04-27 15:09:33,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008705c78/e4ca73063f734fb1ad56bd2a152b347f [2022-04-27 15:09:33,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:09:33,715 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:09:33,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:33,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:09:33,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:09:33,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:33,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e01e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33, skipping insertion in model container [2022-04-27 15:09:33,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:33,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:09:33,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:09:33,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c[4936,4949] [2022-04-27 15:09:33,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:33,937 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:09:33,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c[4936,4949] [2022-04-27 15:09:33,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:33,978 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:09:33,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33 WrapperNode [2022-04-27 15:09:33,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:33,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:09:33,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:09:33,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:09:33,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:33,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:33,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:33,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:34,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:34,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:34,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:34,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:09:34,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:09:34,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:09:34,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:09:34,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (1/1) ... [2022-04-27 15:09:34,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:09:34,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:09:34,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:09:34,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:09:34,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:09:34,113 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:09:34,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:09:34,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:09:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:09:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:09:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:09:34,215 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:09:34,216 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:09:34,531 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:09:34,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:09:34,537 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:09:34,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:34 BoogieIcfgContainer [2022-04-27 15:09:34,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:09:34,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:09:34,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:09:34,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:09:34,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:09:33" (1/3) ... [2022-04-27 15:09:34,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd81845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:34, skipping insertion in model container [2022-04-27 15:09:34,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:33" (2/3) ... [2022-04-27 15:09:34,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd81845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:34, skipping insertion in model container [2022-04-27 15:09:34,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:34" (3/3) ... [2022-04-27 15:09:34,550 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-04-27 15:09:34,562 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:09:34,562 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:09:34,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:09:34,637 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@6a35c556, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d8131fc [2022-04-27 15:09:34,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:09:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:09:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:34,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:34,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:34,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 1 times [2022-04-27 15:09:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:34,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058421988] [2022-04-27 15:09:34,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:34,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {57#true} is VALID [2022-04-27 15:09:34,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-27 15:09:34,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-27 15:09:34,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:34,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {57#true} is VALID [2022-04-27 15:09:34,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-27 15:09:34,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-27 15:09:34,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID [2022-04-27 15:09:34,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {57#true} is VALID [2022-04-27 15:09:34,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {57#true} is VALID [2022-04-27 15:09:34,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {57#true} is VALID [2022-04-27 15:09:34,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume 0 != ~p1~0;~lk1~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p1~0; {62#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:34,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {62#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {58#false} is VALID [2022-04-27 15:09:34,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-04-27 15:09:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:34,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:34,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058421988] [2022-04-27 15:09:34,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058421988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:34,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:34,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722927351] [2022-04-27 15:09:34,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:34,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:09:34,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:34,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:35,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:35,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:35,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:35,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:35,050 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:35,472 INFO L93 Difference]: Finished difference Result 106 states and 187 transitions. [2022-04-27 15:09:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:09:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-27 15:09:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-27 15:09:35,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-27 15:09:35,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:35,711 INFO L225 Difference]: With dead ends: 106 [2022-04-27 15:09:35,712 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 15:09:35,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:35,717 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:35,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 107 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 15:09:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2022-04-27 15:09:35,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:35,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,750 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,753 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:35,763 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-27 15:09:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-27 15:09:35,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:35,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:35,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-27 15:09:35,766 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-27 15:09:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:35,782 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-27 15:09:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-27 15:09:35,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:35,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:35,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:35,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2022-04-27 15:09:35,795 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2022-04-27 15:09:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:35,795 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2022-04-27 15:09:35,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2022-04-27 15:09:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:35,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:35,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:35,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:09:35,797 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 1 times [2022-04-27 15:09:35,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:35,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909307462] [2022-04-27 15:09:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:35,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:35,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {438#true} is VALID [2022-04-27 15:09:35,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} assume true; {438#true} is VALID [2022-04-27 15:09:35,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {438#true} {438#true} #251#return; {438#true} is VALID [2022-04-27 15:09:35,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {438#true} call ULTIMATE.init(); {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:35,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {438#true} is VALID [2022-04-27 15:09:35,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} assume true; {438#true} is VALID [2022-04-27 15:09:35,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {438#true} {438#true} #251#return; {438#true} is VALID [2022-04-27 15:09:35,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#true} call #t~ret18 := main(); {438#true} is VALID [2022-04-27 15:09:35,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {438#true} is VALID [2022-04-27 15:09:35,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {438#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {438#true} is VALID [2022-04-27 15:09:35,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {438#true} is VALID [2022-04-27 15:09:35,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#true} assume !(0 != ~p1~0); {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {443#(= main_~p1~0 0)} assume !(0 != ~p2~0); {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {443#(= main_~p1~0 0)} assume !(0 != ~p10~0); {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {443#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:35,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {443#(= main_~p1~0 0)} assume 0 != ~p1~0; {439#false} is VALID [2022-04-27 15:09:35,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {439#false} assume 1 != ~lk1~0; {439#false} is VALID [2022-04-27 15:09:35,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-04-27 15:09:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:35,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909307462] [2022-04-27 15:09:35,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909307462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:35,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:35,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307685930] [2022-04-27 15:09:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:35,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:09:35,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:35,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:35,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:35,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:35,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:35,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:35,929 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:36,208 INFO L93 Difference]: Finished difference Result 148 states and 273 transitions. [2022-04-27 15:09:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:09:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-27 15:09:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-27 15:09:36,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-27 15:09:36,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:36,417 INFO L225 Difference]: With dead ends: 148 [2022-04-27 15:09:36,418 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 15:09:36,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:36,428 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:36,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 119 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 15:09:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-27 15:09:36,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:36,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,446 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,446 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:36,449 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-27 15:09:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-27 15:09:36,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:36,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:36,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-27 15:09:36,452 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-27 15:09:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:36,455 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-27 15:09:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-27 15:09:36,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:36,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:36,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:36,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 162 transitions. [2022-04-27 15:09:36,464 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 162 transitions. Word has length 24 [2022-04-27 15:09:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:36,464 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 162 transitions. [2022-04-27 15:09:36,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 162 transitions. [2022-04-27 15:09:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:36,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:36,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:36,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:09:36,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 1 times [2022-04-27 15:09:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:36,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749826510] [2022-04-27 15:09:36,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:36,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:36,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {886#true} is VALID [2022-04-27 15:09:36,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {886#true} assume true; {886#true} is VALID [2022-04-27 15:09:36,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {886#true} {886#true} #251#return; {886#true} is VALID [2022-04-27 15:09:36,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {886#true} call ULTIMATE.init(); {892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:36,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {886#true} is VALID [2022-04-27 15:09:36,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2022-04-27 15:09:36,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #251#return; {886#true} is VALID [2022-04-27 15:09:36,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {886#true} call #t~ret18 := main(); {886#true} is VALID [2022-04-27 15:09:36,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {886#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {886#true} is VALID [2022-04-27 15:09:36,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {886#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {886#true} is VALID [2022-04-27 15:09:36,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {886#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {886#true} is VALID [2022-04-27 15:09:36,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {886#true} assume 0 != ~p1~0;~lk1~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {891#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {891#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {891#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {891#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:36,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {891#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {887#false} is VALID [2022-04-27 15:09:36,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {887#false} assume 0 != ~p2~0; {887#false} is VALID [2022-04-27 15:09:36,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {887#false} assume 1 != ~lk2~0; {887#false} is VALID [2022-04-27 15:09:36,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {887#false} assume !false; {887#false} is VALID [2022-04-27 15:09:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:36,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:36,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749826510] [2022-04-27 15:09:36,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749826510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:36,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:36,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422483654] [2022-04-27 15:09:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:36,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:36,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:36,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:36,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:36,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:36,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:36,590 INFO L87 Difference]: Start difference. First operand 89 states and 162 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:36,854 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions. [2022-04-27 15:09:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-27 15:09:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-27 15:09:36,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-27 15:09:37,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:37,051 INFO L225 Difference]: With dead ends: 136 [2022-04-27 15:09:37,052 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 15:09:37,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:37,053 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:37,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 15:09:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-04-27 15:09:37,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:37,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,059 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,060 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:37,063 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-27 15:09:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-27 15:09:37,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:37,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:37,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-27 15:09:37,065 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-27 15:09:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:37,068 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-27 15:09:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-27 15:09:37,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:37,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:37,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:37,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2022-04-27 15:09:37,073 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 25 [2022-04-27 15:09:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:37,073 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2022-04-27 15:09:37,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2022-04-27 15:09:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:37,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:37,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:37,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:09:37,074 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 1 times [2022-04-27 15:09:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:37,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291252767] [2022-04-27 15:09:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:37,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {1339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1333#true} is VALID [2022-04-27 15:09:37,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#true} assume true; {1333#true} is VALID [2022-04-27 15:09:37,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1333#true} {1333#true} #251#return; {1333#true} is VALID [2022-04-27 15:09:37,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:37,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {1339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1333#true} is VALID [2022-04-27 15:09:37,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2022-04-27 15:09:37,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #251#return; {1333#true} is VALID [2022-04-27 15:09:37,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret18 := main(); {1333#true} is VALID [2022-04-27 15:09:37,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {1333#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1333#true} is VALID [2022-04-27 15:09:37,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {1333#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1333#true} is VALID [2022-04-27 15:09:37,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {1333#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1333#true} is VALID [2022-04-27 15:09:37,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {1333#true} assume !(0 != ~p1~0); {1333#true} is VALID [2022-04-27 15:09:37,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {1333#true} assume !(0 != ~p2~0); {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {1338#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {1338#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1338#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:37,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p2~0; {1334#false} is VALID [2022-04-27 15:09:37,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {1334#false} assume 1 != ~lk2~0; {1334#false} is VALID [2022-04-27 15:09:37,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2022-04-27 15:09:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:37,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291252767] [2022-04-27 15:09:37,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291252767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:37,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:37,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594747369] [2022-04-27 15:09:37,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:37,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:37,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:37,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:37,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:37,156 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:37,410 INFO L93 Difference]: Finished difference Result 256 states and 468 transitions. [2022-04-27 15:09:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:37,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-27 15:09:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-27 15:09:37,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-27 15:09:37,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:37,607 INFO L225 Difference]: With dead ends: 256 [2022-04-27 15:09:37,607 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 15:09:37,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:37,608 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:37,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 97 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 15:09:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-27 15:09:37,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:37,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,617 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,618 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:37,622 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-27 15:09:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-27 15:09:37,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:37,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:37,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-27 15:09:37,625 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-27 15:09:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:37,630 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-27 15:09:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-27 15:09:37,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:37,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:37,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:37,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 309 transitions. [2022-04-27 15:09:37,637 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 309 transitions. Word has length 25 [2022-04-27 15:09:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:37,637 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 309 transitions. [2022-04-27 15:09:37,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 309 transitions. [2022-04-27 15:09:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:37,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:37,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:37,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:09:37,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 1 times [2022-04-27 15:09:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:37,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199843592] [2022-04-27 15:09:37,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:37,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:37,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {2148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2142#true} is VALID [2022-04-27 15:09:37,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {2142#true} assume true; {2142#true} is VALID [2022-04-27 15:09:37,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2142#true} {2142#true} #251#return; {2142#true} is VALID [2022-04-27 15:09:37,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {2142#true} call ULTIMATE.init(); {2148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:37,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {2148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2142#true} is VALID [2022-04-27 15:09:37,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {2142#true} assume true; {2142#true} is VALID [2022-04-27 15:09:37,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2142#true} {2142#true} #251#return; {2142#true} is VALID [2022-04-27 15:09:37,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {2142#true} call #t~ret18 := main(); {2142#true} is VALID [2022-04-27 15:09:37,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {2142#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {2142#true} is VALID [2022-04-27 15:09:37,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {2142#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {2142#true} is VALID [2022-04-27 15:09:37,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {2142#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {2142#true} is VALID [2022-04-27 15:09:37,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {2142#true} assume !(0 != ~p1~0); {2142#true} is VALID [2022-04-27 15:09:37,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {2142#true} assume 0 != ~p2~0;~lk2~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {2147#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {2147#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {2147#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2147#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:37,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {2147#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2143#false} is VALID [2022-04-27 15:09:37,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {2143#false} assume !false; {2143#false} is VALID [2022-04-27 15:09:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:37,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199843592] [2022-04-27 15:09:37,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199843592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:37,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:37,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493122169] [2022-04-27 15:09:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:37,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:37,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:37,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:37,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:37,734 INFO L87 Difference]: Start difference. First operand 171 states and 309 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:37,949 INFO L93 Difference]: Finished difference Result 223 states and 403 transitions. [2022-04-27 15:09:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-27 15:09:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-27 15:09:37,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-27 15:09:38,077 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:09:38,081 INFO L225 Difference]: With dead ends: 223 [2022-04-27 15:09:38,081 INFO L226 Difference]: Without dead ends: 221 [2022-04-27 15:09:38,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:38,083 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:38,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-27 15:09:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 171. [2022-04-27 15:09:38,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:38,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,092 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,092 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:38,098 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-27 15:09:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-27 15:09:38,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:38,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:38,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-27 15:09:38,100 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-27 15:09:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:38,107 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-27 15:09:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-27 15:09:38,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:38,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:38,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:38,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 307 transitions. [2022-04-27 15:09:38,112 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 307 transitions. Word has length 25 [2022-04-27 15:09:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:38,113 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 307 transitions. [2022-04-27 15:09:38,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 307 transitions. [2022-04-27 15:09:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:38,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:38,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:38,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:09:38,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 1 times [2022-04-27 15:09:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:38,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878574491] [2022-04-27 15:09:38,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:38,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:38,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {3020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3014#true} is VALID [2022-04-27 15:09:38,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {3014#true} assume true; {3014#true} is VALID [2022-04-27 15:09:38,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3014#true} {3014#true} #251#return; {3014#true} is VALID [2022-04-27 15:09:38,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {3014#true} call ULTIMATE.init(); {3020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:38,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {3020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3014#true} is VALID [2022-04-27 15:09:38,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {3014#true} assume true; {3014#true} is VALID [2022-04-27 15:09:38,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3014#true} {3014#true} #251#return; {3014#true} is VALID [2022-04-27 15:09:38,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {3014#true} call #t~ret18 := main(); {3014#true} is VALID [2022-04-27 15:09:38,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {3014#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {3014#true} is VALID [2022-04-27 15:09:38,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {3014#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {3014#true} is VALID [2022-04-27 15:09:38,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {3014#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {3014#true} is VALID [2022-04-27 15:09:38,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {3014#true} assume !(0 != ~p1~0); {3014#true} is VALID [2022-04-27 15:09:38,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {3014#true} assume !(0 != ~p2~0); {3014#true} is VALID [2022-04-27 15:09:38,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {3014#true} assume 0 != ~p3~0;~lk3~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {3019#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {3019#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {3019#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {3019#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3019#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:38,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {3019#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3015#false} is VALID [2022-04-27 15:09:38,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {3015#false} assume !false; {3015#false} is VALID [2022-04-27 15:09:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:38,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:38,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878574491] [2022-04-27 15:09:38,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878574491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:38,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:38,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:38,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660271379] [2022-04-27 15:09:38,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:38,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:38,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:38,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:38,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:38,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:38,184 INFO L87 Difference]: Start difference. First operand 171 states and 307 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:38,412 INFO L93 Difference]: Finished difference Result 323 states and 587 transitions. [2022-04-27 15:09:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:09:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:09:38,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-27 15:09:38,549 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:09:38,555 INFO L225 Difference]: With dead ends: 323 [2022-04-27 15:09:38,555 INFO L226 Difference]: Without dead ends: 321 [2022-04-27 15:09:38,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:38,559 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:38,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-27 15:09:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 231. [2022-04-27 15:09:38,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:38,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,582 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,583 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:38,592 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-27 15:09:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-27 15:09:38,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:38,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:38,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 15:09:38,594 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 15:09:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:38,602 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-27 15:09:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-27 15:09:38,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:38,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:38,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:38,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 413 transitions. [2022-04-27 15:09:38,609 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 413 transitions. Word has length 26 [2022-04-27 15:09:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:38,609 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 413 transitions. [2022-04-27 15:09:38,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 413 transitions. [2022-04-27 15:09:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:38,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:38,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:38,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:09:38,613 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 1 times [2022-04-27 15:09:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:38,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676788866] [2022-04-27 15:09:38,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:38,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {4254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4248#true} is VALID [2022-04-27 15:09:38,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {4248#true} assume true; {4248#true} is VALID [2022-04-27 15:09:38,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4248#true} {4248#true} #251#return; {4248#true} is VALID [2022-04-27 15:09:38,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {4248#true} call ULTIMATE.init(); {4254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:38,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {4254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4248#true} is VALID [2022-04-27 15:09:38,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {4248#true} assume true; {4248#true} is VALID [2022-04-27 15:09:38,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4248#true} {4248#true} #251#return; {4248#true} is VALID [2022-04-27 15:09:38,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {4248#true} call #t~ret18 := main(); {4248#true} is VALID [2022-04-27 15:09:38,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {4248#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {4248#true} is VALID [2022-04-27 15:09:38,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {4248#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {4248#true} is VALID [2022-04-27 15:09:38,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {4248#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {4248#true} is VALID [2022-04-27 15:09:38,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {4248#true} assume !(0 != ~p1~0); {4248#true} is VALID [2022-04-27 15:09:38,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {4248#true} assume !(0 != ~p2~0); {4248#true} is VALID [2022-04-27 15:09:38,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {4248#true} assume !(0 != ~p3~0); {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {4253#(= main_~p3~0 0)} assume !(0 != ~p10~0); {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {4253#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {4253#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4253#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:38,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {4253#(= main_~p3~0 0)} assume 0 != ~p3~0; {4249#false} is VALID [2022-04-27 15:09:38,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {4249#false} assume 1 != ~lk3~0; {4249#false} is VALID [2022-04-27 15:09:38,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {4249#false} assume !false; {4249#false} is VALID [2022-04-27 15:09:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:38,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676788866] [2022-04-27 15:09:38,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676788866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:38,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:38,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149592760] [2022-04-27 15:09:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:38,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:38,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:38,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:38,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:38,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:38,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:38,700 INFO L87 Difference]: Start difference. First operand 231 states and 413 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:38,930 INFO L93 Difference]: Finished difference Result 551 states and 995 transitions. [2022-04-27 15:09:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-27 15:09:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-27 15:09:38,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-27 15:09:39,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:39,116 INFO L225 Difference]: With dead ends: 551 [2022-04-27 15:09:39,116 INFO L226 Difference]: Without dead ends: 329 [2022-04-27 15:09:39,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:39,117 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:39,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 123 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-27 15:09:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-27 15:09:39,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:39,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,147 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,147 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,155 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-27 15:09:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-27 15:09:39,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:39,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:39,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-27 15:09:39,157 INFO L87 Difference]: Start difference. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-27 15:09:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,165 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-27 15:09:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-27 15:09:39,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:39,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:39,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:39,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 583 transitions. [2022-04-27 15:09:39,174 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 583 transitions. Word has length 26 [2022-04-27 15:09:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:39,174 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 583 transitions. [2022-04-27 15:09:39,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 583 transitions. [2022-04-27 15:09:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:39,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:39,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:39,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:09:39,175 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 1 times [2022-04-27 15:09:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:39,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279424127] [2022-04-27 15:09:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:39,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:39,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {5836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5830#true} is VALID [2022-04-27 15:09:39,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {5830#true} assume true; {5830#true} is VALID [2022-04-27 15:09:39,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5830#true} {5830#true} #251#return; {5830#true} is VALID [2022-04-27 15:09:39,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {5830#true} call ULTIMATE.init(); {5836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:39,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {5836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5830#true} is VALID [2022-04-27 15:09:39,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {5830#true} assume true; {5830#true} is VALID [2022-04-27 15:09:39,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5830#true} {5830#true} #251#return; {5830#true} is VALID [2022-04-27 15:09:39,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {5830#true} call #t~ret18 := main(); {5830#true} is VALID [2022-04-27 15:09:39,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {5830#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {5830#true} is VALID [2022-04-27 15:09:39,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {5830#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {5830#true} is VALID [2022-04-27 15:09:39,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {5830#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {5830#true} is VALID [2022-04-27 15:09:39,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {5830#true} assume !(0 != ~p1~0); {5830#true} is VALID [2022-04-27 15:09:39,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {5830#true} assume !(0 != ~p2~0); {5830#true} is VALID [2022-04-27 15:09:39,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {5830#true} assume 0 != ~p3~0;~lk3~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {5835#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {5835#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {5835#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {5835#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5835#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:39,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {5835#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5831#false} is VALID [2022-04-27 15:09:39,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {5831#false} assume 0 != ~p4~0; {5831#false} is VALID [2022-04-27 15:09:39,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {5831#false} assume 1 != ~lk4~0; {5831#false} is VALID [2022-04-27 15:09:39,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {5831#false} assume !false; {5831#false} is VALID [2022-04-27 15:09:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279424127] [2022-04-27 15:09:39,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279424127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:39,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:39,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925790484] [2022-04-27 15:09:39,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:39,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:39,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:39,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:39,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:39,244 INFO L87 Difference]: Start difference. First operand 327 states and 583 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,474 INFO L93 Difference]: Finished difference Result 493 states and 877 transitions. [2022-04-27 15:09:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:39,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:09:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-27 15:09:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-27 15:09:39,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-27 15:09:39,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:39,664 INFO L225 Difference]: With dead ends: 493 [2022-04-27 15:09:39,664 INFO L226 Difference]: Without dead ends: 335 [2022-04-27 15:09:39,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:39,665 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 168 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:39,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 137 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-27 15:09:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2022-04-27 15:09:39,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:39,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,678 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,679 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,687 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-27 15:09:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-27 15:09:39,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:39,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:39,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states. [2022-04-27 15:09:39,690 INFO L87 Difference]: Start difference. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states. [2022-04-27 15:09:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,697 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-27 15:09:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-27 15:09:39,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:39,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:39,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:39,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 587 transitions. [2022-04-27 15:09:39,707 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 587 transitions. Word has length 27 [2022-04-27 15:09:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:39,707 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 587 transitions. [2022-04-27 15:09:39,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 587 transitions. [2022-04-27 15:09:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:39,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:39,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:39,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:09:39,708 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 1 times [2022-04-27 15:09:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:39,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748801324] [2022-04-27 15:09:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:39,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {7378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7372#true} is VALID [2022-04-27 15:09:39,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {7372#true} assume true; {7372#true} is VALID [2022-04-27 15:09:39,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7372#true} {7372#true} #251#return; {7372#true} is VALID [2022-04-27 15:09:39,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {7372#true} call ULTIMATE.init(); {7378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:39,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {7378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7372#true} is VALID [2022-04-27 15:09:39,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {7372#true} assume true; {7372#true} is VALID [2022-04-27 15:09:39,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7372#true} {7372#true} #251#return; {7372#true} is VALID [2022-04-27 15:09:39,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {7372#true} call #t~ret18 := main(); {7372#true} is VALID [2022-04-27 15:09:39,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {7372#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {7372#true} is VALID [2022-04-27 15:09:39,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {7372#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {7372#true} is VALID [2022-04-27 15:09:39,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {7372#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {7372#true} is VALID [2022-04-27 15:09:39,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {7372#true} assume !(0 != ~p1~0); {7372#true} is VALID [2022-04-27 15:09:39,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {7372#true} assume !(0 != ~p2~0); {7372#true} is VALID [2022-04-27 15:09:39,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {7372#true} assume !(0 != ~p3~0); {7372#true} is VALID [2022-04-27 15:09:39,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {7372#true} assume 0 != ~p4~0;~lk4~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {7377#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {7377#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {7377#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {7377#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {7377#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7377#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:39,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {7377#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7373#false} is VALID [2022-04-27 15:09:39,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {7373#false} assume !false; {7373#false} is VALID [2022-04-27 15:09:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:39,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748801324] [2022-04-27 15:09:39,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748801324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:39,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:39,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525502661] [2022-04-27 15:09:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:39,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:39,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:39,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:39,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:39,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:39,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:39,813 INFO L87 Difference]: Start difference. First operand 333 states and 587 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,033 INFO L93 Difference]: Finished difference Result 621 states and 1109 transitions. [2022-04-27 15:09:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:40,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-27 15:09:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-27 15:09:40,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-27 15:09:40,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:40,174 INFO L225 Difference]: With dead ends: 621 [2022-04-27 15:09:40,174 INFO L226 Difference]: Without dead ends: 619 [2022-04-27 15:09:40,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:40,177 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:40,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 93 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-27 15:09:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457. [2022-04-27 15:09:40,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:40,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,188 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,190 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,210 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-27 15:09:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-27 15:09:40,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:40,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:40,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-27 15:09:40,213 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-27 15:09:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,235 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-27 15:09:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-27 15:09:40,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:40,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:40,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:40,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 795 transitions. [2022-04-27 15:09:40,250 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 795 transitions. Word has length 27 [2022-04-27 15:09:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:40,251 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 795 transitions. [2022-04-27 15:09:40,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 795 transitions. [2022-04-27 15:09:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:40,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:40,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:40,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:09:40,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:40,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 1 times [2022-04-27 15:09:40,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:40,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103945159] [2022-04-27 15:09:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:40,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:40,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {9744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9738#true} is VALID [2022-04-27 15:09:40,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {9738#true} assume true; {9738#true} is VALID [2022-04-27 15:09:40,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9738#true} {9738#true} #251#return; {9738#true} is VALID [2022-04-27 15:09:40,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {9738#true} call ULTIMATE.init(); {9744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:40,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {9744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9738#true} is VALID [2022-04-27 15:09:40,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {9738#true} assume true; {9738#true} is VALID [2022-04-27 15:09:40,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9738#true} {9738#true} #251#return; {9738#true} is VALID [2022-04-27 15:09:40,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {9738#true} call #t~ret18 := main(); {9738#true} is VALID [2022-04-27 15:09:40,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {9738#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {9738#true} is VALID [2022-04-27 15:09:40,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {9738#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {9738#true} is VALID [2022-04-27 15:09:40,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {9738#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {9738#true} is VALID [2022-04-27 15:09:40,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {9738#true} assume !(0 != ~p1~0); {9738#true} is VALID [2022-04-27 15:09:40,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {9738#true} assume !(0 != ~p2~0); {9738#true} is VALID [2022-04-27 15:09:40,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {9738#true} assume !(0 != ~p3~0); {9738#true} is VALID [2022-04-27 15:09:40,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {9738#true} assume !(0 != ~p4~0); {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {9743#(= main_~p4~0 0)} assume !(0 != ~p10~0); {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {9743#(= main_~p4~0 0)} assume !(0 != ~p1~0); {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {9743#(= main_~p4~0 0)} assume !(0 != ~p2~0); {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {9743#(= main_~p4~0 0)} assume !(0 != ~p3~0); {9743#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:40,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {9743#(= main_~p4~0 0)} assume 0 != ~p4~0; {9739#false} is VALID [2022-04-27 15:09:40,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {9739#false} assume 1 != ~lk4~0; {9739#false} is VALID [2022-04-27 15:09:40,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {9739#false} assume !false; {9739#false} is VALID [2022-04-27 15:09:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:40,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103945159] [2022-04-27 15:09:40,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103945159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:40,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:40,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:40,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773585955] [2022-04-27 15:09:40,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:40,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:40,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:40,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:40,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:40,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:40,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:40,345 INFO L87 Difference]: Start difference. First operand 457 states and 795 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,623 INFO L93 Difference]: Finished difference Result 1085 states and 1901 transitions. [2022-04-27 15:09:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-27 15:09:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-27 15:09:40,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 237 transitions. [2022-04-27 15:09:40,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:40,825 INFO L225 Difference]: With dead ends: 1085 [2022-04-27 15:09:40,825 INFO L226 Difference]: Without dead ends: 643 [2022-04-27 15:09:40,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:40,826 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:40,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 125 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-27 15:09:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2022-04-27 15:09:40,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:40,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,842 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,845 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,867 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-27 15:09:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-27 15:09:40,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:40,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:40,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states. [2022-04-27 15:09:40,871 INFO L87 Difference]: Start difference. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states. [2022-04-27 15:09:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,893 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-27 15:09:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-27 15:09:40,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:40,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:40,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:40,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1111 transitions. [2022-04-27 15:09:40,916 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1111 transitions. Word has length 27 [2022-04-27 15:09:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:40,917 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 1111 transitions. [2022-04-27 15:09:40,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1111 transitions. [2022-04-27 15:09:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:40,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:40,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:40,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:09:40,919 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 1 times [2022-04-27 15:09:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:40,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651770347] [2022-04-27 15:09:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:40,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:40,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:40,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {12822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12816#true} is VALID [2022-04-27 15:09:40,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {12816#true} assume true; {12816#true} is VALID [2022-04-27 15:09:40,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12816#true} {12816#true} #251#return; {12816#true} is VALID [2022-04-27 15:09:40,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {12816#true} call ULTIMATE.init(); {12822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:40,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {12822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12816#true} is VALID [2022-04-27 15:09:40,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {12816#true} assume true; {12816#true} is VALID [2022-04-27 15:09:40,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12816#true} {12816#true} #251#return; {12816#true} is VALID [2022-04-27 15:09:40,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {12816#true} call #t~ret18 := main(); {12816#true} is VALID [2022-04-27 15:09:40,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {12816#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {12816#true} is VALID [2022-04-27 15:09:40,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {12816#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {12816#true} is VALID [2022-04-27 15:09:40,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {12816#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {12816#true} is VALID [2022-04-27 15:09:40,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {12816#true} assume !(0 != ~p1~0); {12816#true} is VALID [2022-04-27 15:09:40,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {12816#true} assume !(0 != ~p2~0); {12816#true} is VALID [2022-04-27 15:09:40,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {12816#true} assume !(0 != ~p3~0); {12816#true} is VALID [2022-04-27 15:09:40,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {12816#true} assume 0 != ~p4~0;~lk4~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {12821#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {12821#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {12821#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {12821#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {12821#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {12821#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {12821#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {12821#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {12821#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {12821#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {12821#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {12821#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {12821#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:40,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {12821#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {12817#false} is VALID [2022-04-27 15:09:40,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {12817#false} assume 0 != ~p5~0; {12817#false} is VALID [2022-04-27 15:09:40,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {12817#false} assume 1 != ~lk5~0; {12817#false} is VALID [2022-04-27 15:09:40,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {12817#false} assume !false; {12817#false} is VALID [2022-04-27 15:09:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:40,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651770347] [2022-04-27 15:09:40,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651770347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:40,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:40,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:40,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761402047] [2022-04-27 15:09:40,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:40,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:40,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:40,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:40,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:40,999 INFO L87 Difference]: Start difference. First operand 641 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:41,256 INFO L93 Difference]: Finished difference Result 961 states and 1661 transitions. [2022-04-27 15:09:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:41,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-27 15:09:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-27 15:09:41,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 232 transitions. [2022-04-27 15:09:41,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:41,463 INFO L225 Difference]: With dead ends: 961 [2022-04-27 15:09:41,463 INFO L226 Difference]: Without dead ends: 651 [2022-04-27 15:09:41,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:41,464 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:41,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 134 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-04-27 15:09:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2022-04-27 15:09:41,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:41,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,478 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,479 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:41,501 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-27 15:09:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-27 15:09:41,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:41,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:41,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states. [2022-04-27 15:09:41,504 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states. [2022-04-27 15:09:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:41,526 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-27 15:09:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-27 15:09:41,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:41,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:41,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:41,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1111 transitions. [2022-04-27 15:09:41,550 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1111 transitions. Word has length 28 [2022-04-27 15:09:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:41,550 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1111 transitions. [2022-04-27 15:09:41,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,551 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1111 transitions. [2022-04-27 15:09:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:41,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:41,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:41,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:09:41,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 1 times [2022-04-27 15:09:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:41,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618865387] [2022-04-27 15:09:41,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:41,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:41,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {15800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15794#true} is VALID [2022-04-27 15:09:41,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {15794#true} assume true; {15794#true} is VALID [2022-04-27 15:09:41,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15794#true} {15794#true} #251#return; {15794#true} is VALID [2022-04-27 15:09:41,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {15794#true} call ULTIMATE.init(); {15800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:41,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {15800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15794#true} is VALID [2022-04-27 15:09:41,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {15794#true} assume true; {15794#true} is VALID [2022-04-27 15:09:41,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15794#true} {15794#true} #251#return; {15794#true} is VALID [2022-04-27 15:09:41,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {15794#true} call #t~ret18 := main(); {15794#true} is VALID [2022-04-27 15:09:41,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {15794#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {15794#true} is VALID [2022-04-27 15:09:41,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {15794#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {15794#true} is VALID [2022-04-27 15:09:41,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {15794#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {15794#true} is VALID [2022-04-27 15:09:41,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {15794#true} assume !(0 != ~p1~0); {15794#true} is VALID [2022-04-27 15:09:41,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {15794#true} assume !(0 != ~p2~0); {15794#true} is VALID [2022-04-27 15:09:41,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {15794#true} assume !(0 != ~p3~0); {15794#true} is VALID [2022-04-27 15:09:41,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {15794#true} assume !(0 != ~p4~0); {15794#true} is VALID [2022-04-27 15:09:41,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {15794#true} assume 0 != ~p5~0;~lk5~0 := 1; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {15799#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {15799#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {15799#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {15799#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {15799#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {15799#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {15799#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {15799#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {15799#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {15799#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {15799#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {15799#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {15799#(= main_~lk5~0 1)} assume 0 != ~p5~0; {15799#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:41,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {15799#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {15795#false} is VALID [2022-04-27 15:09:41,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {15795#false} assume !false; {15795#false} is VALID [2022-04-27 15:09:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:41,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:41,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618865387] [2022-04-27 15:09:41,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618865387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:41,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:41,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626807720] [2022-04-27 15:09:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:41,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:41,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:41,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:41,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:41,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:41,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:41,617 INFO L87 Difference]: Start difference. First operand 649 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:41,929 INFO L93 Difference]: Finished difference Result 1197 states and 2081 transitions. [2022-04-27 15:09:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:09:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:09:41,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-27 15:09:42,070 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:09:42,138 INFO L225 Difference]: With dead ends: 1197 [2022-04-27 15:09:42,138 INFO L226 Difference]: Without dead ends: 1195 [2022-04-27 15:09:42,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:42,139 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:42,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-04-27 15:09:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 905. [2022-04-27 15:09:42,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:42,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,165 INFO L74 IsIncluded]: Start isIncluded. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,166 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,228 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-27 15:09:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-27 15:09:42,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1195 states. [2022-04-27 15:09:42,234 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1195 states. [2022-04-27 15:09:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,294 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-27 15:09:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-27 15:09:42,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:42,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1519 transitions. [2022-04-27 15:09:42,338 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1519 transitions. Word has length 28 [2022-04-27 15:09:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:42,338 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1519 transitions. [2022-04-27 15:09:42,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1519 transitions. [2022-04-27 15:09:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:42,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:42,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:42,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:09:42,340 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:42,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 1 times [2022-04-27 15:09:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:42,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800023253] [2022-04-27 15:09:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:42,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {20366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20360#true} is VALID [2022-04-27 15:09:42,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {20360#true} assume true; {20360#true} is VALID [2022-04-27 15:09:42,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20360#true} {20360#true} #251#return; {20360#true} is VALID [2022-04-27 15:09:42,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {20360#true} call ULTIMATE.init(); {20366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:42,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {20366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20360#true} is VALID [2022-04-27 15:09:42,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {20360#true} assume true; {20360#true} is VALID [2022-04-27 15:09:42,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20360#true} {20360#true} #251#return; {20360#true} is VALID [2022-04-27 15:09:42,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {20360#true} call #t~ret18 := main(); {20360#true} is VALID [2022-04-27 15:09:42,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {20360#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {20360#true} is VALID [2022-04-27 15:09:42,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {20360#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {20360#true} is VALID [2022-04-27 15:09:42,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {20360#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {20360#true} is VALID [2022-04-27 15:09:42,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {20360#true} assume !(0 != ~p1~0); {20360#true} is VALID [2022-04-27 15:09:42,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {20360#true} assume !(0 != ~p2~0); {20360#true} is VALID [2022-04-27 15:09:42,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {20360#true} assume !(0 != ~p3~0); {20360#true} is VALID [2022-04-27 15:09:42,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {20360#true} assume !(0 != ~p4~0); {20360#true} is VALID [2022-04-27 15:09:42,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {20360#true} assume !(0 != ~p5~0); {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {20365#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {20365#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {20365#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {20365#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {20365#(= main_~p5~0 0)} assume !(0 != ~p10~0); {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {20365#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {20365#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {20365#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {20365#(= main_~p5~0 0)} assume !(0 != ~p1~0); {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {20365#(= main_~p5~0 0)} assume !(0 != ~p2~0); {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {20365#(= main_~p5~0 0)} assume !(0 != ~p3~0); {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {20365#(= main_~p5~0 0)} assume !(0 != ~p4~0); {20365#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:42,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {20365#(= main_~p5~0 0)} assume 0 != ~p5~0; {20361#false} is VALID [2022-04-27 15:09:42,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {20361#false} assume 1 != ~lk5~0; {20361#false} is VALID [2022-04-27 15:09:42,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {20361#false} assume !false; {20361#false} is VALID [2022-04-27 15:09:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:42,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800023253] [2022-04-27 15:09:42,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800023253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:42,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:42,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045048736] [2022-04-27 15:09:42,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:42,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:42,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:42,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:42,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:42,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:42,405 INFO L87 Difference]: Start difference. First operand 905 states and 1519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,788 INFO L93 Difference]: Finished difference Result 2141 states and 3617 transitions. [2022-04-27 15:09:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-27 15:09:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-27 15:09:42,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 234 transitions. [2022-04-27 15:09:42,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:43,007 INFO L225 Difference]: With dead ends: 2141 [2022-04-27 15:09:43,008 INFO L226 Difference]: Without dead ends: 1259 [2022-04-27 15:09:43,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:43,009 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:43,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-04-27 15:09:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1257. [2022-04-27 15:09:43,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:43,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,037 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,038 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:43,094 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-27 15:09:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-27 15:09:43,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:43,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:43,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1259 states. [2022-04-27 15:09:43,100 INFO L87 Difference]: Start difference. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1259 states. [2022-04-27 15:09:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:43,166 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-27 15:09:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-27 15:09:43,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:43,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:43,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:43,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2103 transitions. [2022-04-27 15:09:43,240 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2103 transitions. Word has length 28 [2022-04-27 15:09:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:43,240 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 2103 transitions. [2022-04-27 15:09:43,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2103 transitions. [2022-04-27 15:09:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:43,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:43,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:43,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:09:43,242 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 1 times [2022-04-27 15:09:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:43,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931476881] [2022-04-27 15:09:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:43,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:43,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {26388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {26382#true} is VALID [2022-04-27 15:09:43,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {26382#true} assume true; {26382#true} is VALID [2022-04-27 15:09:43,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26382#true} {26382#true} #251#return; {26382#true} is VALID [2022-04-27 15:09:43,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {26382#true} call ULTIMATE.init(); {26388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:43,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {26388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {26382#true} assume true; {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26382#true} {26382#true} #251#return; {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {26382#true} call #t~ret18 := main(); {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {26382#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {26382#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {26382#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {26382#true} assume !(0 != ~p1~0); {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {26382#true} assume !(0 != ~p2~0); {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {26382#true} assume !(0 != ~p3~0); {26382#true} is VALID [2022-04-27 15:09:43,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {26382#true} assume !(0 != ~p4~0); {26382#true} is VALID [2022-04-27 15:09:43,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {26382#true} assume 0 != ~p5~0;~lk5~0 := 1; {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {26387#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {26387#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {26387#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {26387#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {26387#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {26387#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {26387#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {26387#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {26387#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {26387#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {26387#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {26387#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {26387#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:43,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {26387#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {26383#false} is VALID [2022-04-27 15:09:43,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {26383#false} assume 0 != ~p6~0; {26383#false} is VALID [2022-04-27 15:09:43,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {26383#false} assume 1 != ~lk6~0; {26383#false} is VALID [2022-04-27 15:09:43,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {26383#false} assume !false; {26383#false} is VALID [2022-04-27 15:09:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:43,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:43,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931476881] [2022-04-27 15:09:43,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931476881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:43,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:43,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:43,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029925745] [2022-04-27 15:09:43,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:43,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:43,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:43,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:43,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:43,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:43,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:43,308 INFO L87 Difference]: Start difference. First operand 1257 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:43,700 INFO L93 Difference]: Finished difference Result 1885 states and 3145 transitions. [2022-04-27 15:09:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:43,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-27 15:09:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-27 15:09:43,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 229 transitions. [2022-04-27 15:09:43,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:43,943 INFO L225 Difference]: With dead ends: 1885 [2022-04-27 15:09:43,944 INFO L226 Difference]: Without dead ends: 1275 [2022-04-27 15:09:43,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:43,946 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:43,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-04-27 15:09:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1273. [2022-04-27 15:09:43,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:43,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,974 INFO L74 IsIncluded]: Start isIncluded. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,975 INFO L87 Difference]: Start difference. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,041 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-27 15:09:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-27 15:09:44,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:44,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:44,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1275 states. [2022-04-27 15:09:44,047 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1275 states. [2022-04-27 15:09:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,122 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-27 15:09:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-27 15:09:44,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:44,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:44,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:44,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2103 transitions. [2022-04-27 15:09:44,199 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2103 transitions. Word has length 29 [2022-04-27 15:09:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:44,199 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 2103 transitions. [2022-04-27 15:09:44,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2103 transitions. [2022-04-27 15:09:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:44,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:44,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:44,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:09:44,201 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 1 times [2022-04-27 15:09:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:44,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192558063] [2022-04-27 15:09:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:44,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:44,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {32202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {32196#true} is VALID [2022-04-27 15:09:44,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {32196#true} assume true; {32196#true} is VALID [2022-04-27 15:09:44,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32196#true} {32196#true} #251#return; {32196#true} is VALID [2022-04-27 15:09:44,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {32196#true} call ULTIMATE.init(); {32202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {32202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {32196#true} assume true; {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32196#true} {32196#true} #251#return; {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {32196#true} call #t~ret18 := main(); {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {32196#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {32196#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {32196#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {32196#true} assume !(0 != ~p1~0); {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {32196#true} assume !(0 != ~p2~0); {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {32196#true} assume !(0 != ~p3~0); {32196#true} is VALID [2022-04-27 15:09:44,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {32196#true} assume !(0 != ~p4~0); {32196#true} is VALID [2022-04-27 15:09:44,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {32196#true} assume !(0 != ~p5~0); {32196#true} is VALID [2022-04-27 15:09:44,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {32196#true} assume 0 != ~p6~0;~lk6~0 := 1; {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {32201#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {32201#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {32201#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {32201#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {32201#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {32201#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {32201#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {32201#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {32201#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {32201#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {32201#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {32201#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {32201#(= main_~lk6~0 1)} assume 0 != ~p6~0; {32201#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:44,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {32201#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {32197#false} is VALID [2022-04-27 15:09:44,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {32197#false} assume !false; {32197#false} is VALID [2022-04-27 15:09:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:44,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192558063] [2022-04-27 15:09:44,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192558063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:44,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:44,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029337947] [2022-04-27 15:09:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:44,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:44,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:44,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:44,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:44,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:44,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:44,270 INFO L87 Difference]: Start difference. First operand 1273 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,635 INFO L93 Difference]: Finished difference Result 2317 states and 3897 transitions. [2022-04-27 15:09:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:44,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 15:09:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 15:09:44,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-27 15:09:44,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:44,890 INFO L225 Difference]: With dead ends: 2317 [2022-04-27 15:09:44,890 INFO L226 Difference]: Without dead ends: 2315 [2022-04-27 15:09:44,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:44,892 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:44,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-27 15:09:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1801. [2022-04-27 15:09:44,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:44,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,949 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,951 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:45,164 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-27 15:09:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-27 15:09:45,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:45,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:45,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-27 15:09:45,172 INFO L87 Difference]: Start difference. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-27 15:09:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:45,322 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-27 15:09:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-27 15:09:45,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:45,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:45,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:45,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2903 transitions. [2022-04-27 15:09:45,468 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2903 transitions. Word has length 29 [2022-04-27 15:09:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:45,468 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 2903 transitions. [2022-04-27 15:09:45,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2903 transitions. [2022-04-27 15:09:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:45,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:45,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:45,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:09:45,470 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 1 times [2022-04-27 15:09:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:45,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992841099] [2022-04-27 15:09:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:45,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {41072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41066#true} is VALID [2022-04-27 15:09:45,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {41066#true} assume true; {41066#true} is VALID [2022-04-27 15:09:45,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41066#true} {41066#true} #251#return; {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {41066#true} call ULTIMATE.init(); {41072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:45,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {41072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {41066#true} assume true; {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41066#true} {41066#true} #251#return; {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {41066#true} call #t~ret18 := main(); {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {41066#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {41066#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {41066#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {41066#true} assume !(0 != ~p1~0); {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {41066#true} assume !(0 != ~p2~0); {41066#true} is VALID [2022-04-27 15:09:45,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {41066#true} assume !(0 != ~p3~0); {41066#true} is VALID [2022-04-27 15:09:45,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {41066#true} assume !(0 != ~p4~0); {41066#true} is VALID [2022-04-27 15:09:45,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {41066#true} assume !(0 != ~p5~0); {41066#true} is VALID [2022-04-27 15:09:45,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {41066#true} assume !(0 != ~p6~0); {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {41071#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {41071#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {41071#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {41071#(= main_~p6~0 0)} assume !(0 != ~p10~0); {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {41071#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {41071#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {41071#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {41071#(= main_~p6~0 0)} assume !(0 != ~p1~0); {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {41071#(= main_~p6~0 0)} assume !(0 != ~p2~0); {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {41071#(= main_~p6~0 0)} assume !(0 != ~p3~0); {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {41071#(= main_~p6~0 0)} assume !(0 != ~p4~0); {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {41071#(= main_~p6~0 0)} assume !(0 != ~p5~0); {41071#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:45,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {41071#(= main_~p6~0 0)} assume 0 != ~p6~0; {41067#false} is VALID [2022-04-27 15:09:45,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {41067#false} assume 1 != ~lk6~0; {41067#false} is VALID [2022-04-27 15:09:45,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {41067#false} assume !false; {41067#false} is VALID [2022-04-27 15:09:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:45,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:45,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992841099] [2022-04-27 15:09:45,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992841099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:45,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:45,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:45,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039722342] [2022-04-27 15:09:45,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:45,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:45,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:45,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:45,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:45,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:45,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:45,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:45,532 INFO L87 Difference]: Start difference. First operand 1801 states and 2903 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,277 INFO L93 Difference]: Finished difference Result 4237 states and 6873 transitions. [2022-04-27 15:09:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:46,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-27 15:09:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-27 15:09:46,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 231 transitions. [2022-04-27 15:09:46,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:46,616 INFO L225 Difference]: With dead ends: 4237 [2022-04-27 15:09:46,616 INFO L226 Difference]: Without dead ends: 2475 [2022-04-27 15:09:46,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:46,620 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:46,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 129 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-04-27 15:09:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473. [2022-04-27 15:09:46,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:46,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,668 INFO L74 IsIncluded]: Start isIncluded. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,670 INFO L87 Difference]: Start difference. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,847 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-27 15:09:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-27 15:09:46,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:46,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:46,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2475 states. [2022-04-27 15:09:46,855 INFO L87 Difference]: Start difference. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2475 states. [2022-04-27 15:09:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:47,110 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-27 15:09:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-27 15:09:47,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:47,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:47,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:47,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3975 transitions. [2022-04-27 15:09:47,359 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3975 transitions. Word has length 29 [2022-04-27 15:09:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:47,359 INFO L495 AbstractCegarLoop]: Abstraction has 2473 states and 3975 transitions. [2022-04-27 15:09:47,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3975 transitions. [2022-04-27 15:09:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:47,361 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:47,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:47,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:09:47,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 1 times [2022-04-27 15:09:47,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:47,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779146366] [2022-04-27 15:09:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:47,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {52918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {52912#true} is VALID [2022-04-27 15:09:47,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {52912#true} assume true; {52912#true} is VALID [2022-04-27 15:09:47,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52912#true} {52912#true} #251#return; {52912#true} is VALID [2022-04-27 15:09:47,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {52912#true} call ULTIMATE.init(); {52918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:47,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {52918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {52912#true} is VALID [2022-04-27 15:09:47,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {52912#true} assume true; {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52912#true} {52912#true} #251#return; {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {52912#true} call #t~ret18 := main(); {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {52912#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {52912#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {52912#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {52912#true} assume !(0 != ~p1~0); {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {52912#true} assume !(0 != ~p2~0); {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {52912#true} assume !(0 != ~p3~0); {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {52912#true} assume !(0 != ~p4~0); {52912#true} is VALID [2022-04-27 15:09:47,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {52912#true} assume !(0 != ~p5~0); {52912#true} is VALID [2022-04-27 15:09:47,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {52912#true} assume 0 != ~p6~0;~lk6~0 := 1; {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {52917#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {52917#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {52917#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {52917#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {52917#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {52917#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {52917#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {52917#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {52917#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {52917#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {52917#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {52917#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {52917#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:47,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {52917#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {52913#false} is VALID [2022-04-27 15:09:47,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {52913#false} assume 0 != ~p7~0; {52913#false} is VALID [2022-04-27 15:09:47,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {52913#false} assume 1 != ~lk7~0; {52913#false} is VALID [2022-04-27 15:09:47,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {52913#false} assume !false; {52913#false} is VALID [2022-04-27 15:09:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:47,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779146366] [2022-04-27 15:09:47,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779146366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:47,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:47,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663726607] [2022-04-27 15:09:47,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:09:47,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:47,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:47,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:47,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:47,446 INFO L87 Difference]: Start difference. First operand 2473 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:48,137 INFO L93 Difference]: Finished difference Result 3709 states and 5945 transitions. [2022-04-27 15:09:48,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:48,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:09:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-27 15:09:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-27 15:09:48,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-27 15:09:48,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:48,484 INFO L225 Difference]: With dead ends: 3709 [2022-04-27 15:09:48,484 INFO L226 Difference]: Without dead ends: 2507 [2022-04-27 15:09:48,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:48,487 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:48,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 128 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-27 15:09:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2022-04-27 15:09:48,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:48,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,534 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,536 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:48,710 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-27 15:09:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-27 15:09:48,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:48,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:48,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states. [2022-04-27 15:09:48,716 INFO L87 Difference]: Start difference. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states. [2022-04-27 15:09:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:48,926 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-27 15:09:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-27 15:09:48,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:48,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:48,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:48,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3975 transitions. [2022-04-27 15:09:49,146 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3975 transitions. Word has length 30 [2022-04-27 15:09:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:49,146 INFO L495 AbstractCegarLoop]: Abstraction has 2505 states and 3975 transitions. [2022-04-27 15:09:49,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3975 transitions. [2022-04-27 15:09:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:49,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:49,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:49,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:09:49,148 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 1 times [2022-04-27 15:09:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:49,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298642467] [2022-04-27 15:09:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:49,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {64332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {64326#true} is VALID [2022-04-27 15:09:49,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {64326#true} assume true; {64326#true} is VALID [2022-04-27 15:09:49,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64326#true} {64326#true} #251#return; {64326#true} is VALID [2022-04-27 15:09:49,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {64326#true} call ULTIMATE.init(); {64332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:49,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {64332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {64326#true} is VALID [2022-04-27 15:09:49,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {64326#true} assume true; {64326#true} is VALID [2022-04-27 15:09:49,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64326#true} {64326#true} #251#return; {64326#true} is VALID [2022-04-27 15:09:49,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {64326#true} call #t~ret18 := main(); {64326#true} is VALID [2022-04-27 15:09:49,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {64326#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {64326#true} is VALID [2022-04-27 15:09:49,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {64326#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {64326#true} is VALID [2022-04-27 15:09:49,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {64326#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {64326#true} is VALID [2022-04-27 15:09:49,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {64326#true} assume !(0 != ~p1~0); {64326#true} is VALID [2022-04-27 15:09:49,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {64326#true} assume !(0 != ~p2~0); {64326#true} is VALID [2022-04-27 15:09:49,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {64326#true} assume !(0 != ~p3~0); {64326#true} is VALID [2022-04-27 15:09:49,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {64326#true} assume !(0 != ~p4~0); {64326#true} is VALID [2022-04-27 15:09:49,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {64326#true} assume !(0 != ~p5~0); {64326#true} is VALID [2022-04-27 15:09:49,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {64326#true} assume !(0 != ~p6~0); {64326#true} is VALID [2022-04-27 15:09:49,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {64326#true} assume 0 != ~p7~0;~lk7~0 := 1; {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {64331#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {64331#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {64331#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {64331#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {64331#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {64331#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {64331#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {64331#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {64331#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {64331#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {64331#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {64331#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {64331#(= main_~lk7~0 1)} assume 0 != ~p7~0; {64331#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:49,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {64331#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {64327#false} is VALID [2022-04-27 15:09:49,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {64327#false} assume !false; {64327#false} is VALID [2022-04-27 15:09:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:49,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298642467] [2022-04-27 15:09:49,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298642467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:49,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:49,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411400588] [2022-04-27 15:09:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:49,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:09:49,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:49,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:49,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:49,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:49,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:49,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:49,225 INFO L87 Difference]: Start difference. First operand 2505 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:50,046 INFO L93 Difference]: Finished difference Result 4493 states and 7273 transitions. [2022-04-27 15:09:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:50,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:09:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-27 15:09:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-27 15:09:50,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-27 15:09:50,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:50,754 INFO L225 Difference]: With dead ends: 4493 [2022-04-27 15:09:50,754 INFO L226 Difference]: Without dead ends: 4491 [2022-04-27 15:09:50,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:50,756 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:50,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 90 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-27 15:09:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3593. [2022-04-27 15:09:50,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:50,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:50,823 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:50,826 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:51,556 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-27 15:09:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-27 15:09:51,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:51,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:51,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-27 15:09:51,570 INFO L87 Difference]: Start difference. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-27 15:09:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:52,147 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-27 15:09:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-27 15:09:52,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:52,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:52,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:52,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5543 transitions. [2022-04-27 15:09:52,525 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5543 transitions. Word has length 30 [2022-04-27 15:09:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:52,526 INFO L495 AbstractCegarLoop]: Abstraction has 3593 states and 5543 transitions. [2022-04-27 15:09:52,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5543 transitions. [2022-04-27 15:09:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:52,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:52,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:52,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:09:52,528 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 1 times [2022-04-27 15:09:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:52,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193573495] [2022-04-27 15:09:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:52,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {81618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {81612#true} is VALID [2022-04-27 15:09:52,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {81612#true} assume true; {81612#true} is VALID [2022-04-27 15:09:52,565 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81612#true} {81612#true} #251#return; {81612#true} is VALID [2022-04-27 15:09:52,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {81612#true} call ULTIMATE.init(); {81618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:52,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {81618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {81612#true} is VALID [2022-04-27 15:09:52,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {81612#true} assume true; {81612#true} is VALID [2022-04-27 15:09:52,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81612#true} {81612#true} #251#return; {81612#true} is VALID [2022-04-27 15:09:52,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {81612#true} call #t~ret18 := main(); {81612#true} is VALID [2022-04-27 15:09:52,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {81612#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {81612#true} is VALID [2022-04-27 15:09:52,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {81612#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {81612#true} is VALID [2022-04-27 15:09:52,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {81612#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {81612#true} is VALID [2022-04-27 15:09:52,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {81612#true} assume !(0 != ~p1~0); {81612#true} is VALID [2022-04-27 15:09:52,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {81612#true} assume !(0 != ~p2~0); {81612#true} is VALID [2022-04-27 15:09:52,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {81612#true} assume !(0 != ~p3~0); {81612#true} is VALID [2022-04-27 15:09:52,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {81612#true} assume !(0 != ~p4~0); {81612#true} is VALID [2022-04-27 15:09:52,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {81612#true} assume !(0 != ~p5~0); {81612#true} is VALID [2022-04-27 15:09:52,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {81612#true} assume !(0 != ~p6~0); {81612#true} is VALID [2022-04-27 15:09:52,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {81612#true} assume !(0 != ~p7~0); {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {81617#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {81617#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {81617#(= main_~p7~0 0)} assume !(0 != ~p10~0); {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {81617#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {81617#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {81617#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {81617#(= main_~p7~0 0)} assume !(0 != ~p1~0); {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {81617#(= main_~p7~0 0)} assume !(0 != ~p2~0); {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {81617#(= main_~p7~0 0)} assume !(0 != ~p3~0); {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {81617#(= main_~p7~0 0)} assume !(0 != ~p4~0); {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {81617#(= main_~p7~0 0)} assume !(0 != ~p5~0); {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {81617#(= main_~p7~0 0)} assume !(0 != ~p6~0); {81617#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:52,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {81617#(= main_~p7~0 0)} assume 0 != ~p7~0; {81613#false} is VALID [2022-04-27 15:09:52,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {81613#false} assume 1 != ~lk7~0; {81613#false} is VALID [2022-04-27 15:09:52,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {81613#false} assume !false; {81613#false} is VALID [2022-04-27 15:09:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:52,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193573495] [2022-04-27 15:09:52,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193573495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:52,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:52,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153431211] [2022-04-27 15:09:52,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:52,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:09:52,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:52,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:52,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:52,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:52,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:52,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:52,592 INFO L87 Difference]: Start difference. First operand 3593 states and 5543 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:55,036 INFO L93 Difference]: Finished difference Result 8397 states and 13033 transitions. [2022-04-27 15:09:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:09:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-27 15:09:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-27 15:09:55,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-27 15:09:55,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:55,894 INFO L225 Difference]: With dead ends: 8397 [2022-04-27 15:09:55,894 INFO L226 Difference]: Without dead ends: 4875 [2022-04-27 15:09:55,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:55,898 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:55,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-27 15:09:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4873. [2022-04-27 15:09:55,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:55,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,980 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,984 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:56,608 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-27 15:09:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-27 15:09:56,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:56,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:56,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states. [2022-04-27 15:09:56,619 INFO L87 Difference]: Start difference. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states. [2022-04-27 15:09:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:57,212 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-27 15:09:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-27 15:09:57,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:57,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:57,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:57,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7495 transitions. [2022-04-27 15:09:57,912 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7495 transitions. Word has length 30 [2022-04-27 15:09:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:57,913 INFO L495 AbstractCegarLoop]: Abstraction has 4873 states and 7495 transitions. [2022-04-27 15:09:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7495 transitions. [2022-04-27 15:09:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:09:57,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:57,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:57,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:09:57,915 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 1 times [2022-04-27 15:09:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:57,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288052623] [2022-04-27 15:09:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:57,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:57,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {104984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {104978#true} is VALID [2022-04-27 15:09:57,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {104978#true} assume true; {104978#true} is VALID [2022-04-27 15:09:57,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104978#true} {104978#true} #251#return; {104978#true} is VALID [2022-04-27 15:09:57,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {104978#true} call ULTIMATE.init(); {104984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:57,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {104984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {104978#true} is VALID [2022-04-27 15:09:57,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {104978#true} assume true; {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104978#true} {104978#true} #251#return; {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {104978#true} call #t~ret18 := main(); {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {104978#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {104978#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {104978#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {104978#true} assume !(0 != ~p1~0); {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {104978#true} assume !(0 != ~p2~0); {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {104978#true} assume !(0 != ~p3~0); {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {104978#true} assume !(0 != ~p4~0); {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {104978#true} assume !(0 != ~p5~0); {104978#true} is VALID [2022-04-27 15:09:57,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {104978#true} assume !(0 != ~p6~0); {104978#true} is VALID [2022-04-27 15:09:57,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {104978#true} assume 0 != ~p7~0;~lk7~0 := 1; {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {104983#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {104983#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {104983#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {104983#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {104983#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {104983#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {104983#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {104983#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {104983#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {104983#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {104983#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {104983#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {104983#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:57,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {104983#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {104979#false} is VALID [2022-04-27 15:09:57,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {104979#false} assume 0 != ~p8~0; {104979#false} is VALID [2022-04-27 15:09:57,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {104979#false} assume 1 != ~lk8~0; {104979#false} is VALID [2022-04-27 15:09:57,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {104979#false} assume !false; {104979#false} is VALID [2022-04-27 15:09:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:57,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:57,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288052623] [2022-04-27 15:09:57,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288052623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:57,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:57,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:57,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99157762] [2022-04-27 15:09:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:57,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 15:09:57,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:57,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:57,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:57,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:57,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:57,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:57,982 INFO L87 Difference]: Start difference. First operand 4873 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:59,771 INFO L93 Difference]: Finished difference Result 7309 states and 11209 transitions. [2022-04-27 15:09:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 15:09:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-27 15:09:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-27 15:09:59,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-27 15:09:59,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:00,570 INFO L225 Difference]: With dead ends: 7309 [2022-04-27 15:10:00,570 INFO L226 Difference]: Without dead ends: 4939 [2022-04-27 15:10:00,572 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:00,572 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:00,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 125 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-04-27 15:10:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4937. [2022-04-27 15:10:00,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:00,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:00,648 INFO L74 IsIncluded]: Start isIncluded. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:00,652 INFO L87 Difference]: Start difference. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,338 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-27 15:10:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-27 15:10:01,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:01,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:01,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4939 states. [2022-04-27 15:10:01,350 INFO L87 Difference]: Start difference. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4939 states. [2022-04-27 15:10:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,997 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-27 15:10:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-27 15:10:02,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:02,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:02,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:02,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 7495 transitions. [2022-04-27 15:10:02,665 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 7495 transitions. Word has length 31 [2022-04-27 15:10:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:02,665 INFO L495 AbstractCegarLoop]: Abstraction has 4937 states and 7495 transitions. [2022-04-27 15:10:02,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 7495 transitions. [2022-04-27 15:10:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:10:02,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:02,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:02,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:10:02,668 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:02,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 1 times [2022-04-27 15:10:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:02,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282513275] [2022-04-27 15:10:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:02,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:02,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {127454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {127448#true} is VALID [2022-04-27 15:10:02,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {127448#true} assume true; {127448#true} is VALID [2022-04-27 15:10:02,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127448#true} {127448#true} #251#return; {127448#true} is VALID [2022-04-27 15:10:02,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {127448#true} call ULTIMATE.init(); {127454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:02,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {127454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {127448#true} is VALID [2022-04-27 15:10:02,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {127448#true} assume true; {127448#true} is VALID [2022-04-27 15:10:02,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127448#true} {127448#true} #251#return; {127448#true} is VALID [2022-04-27 15:10:02,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {127448#true} call #t~ret18 := main(); {127448#true} is VALID [2022-04-27 15:10:02,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {127448#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {127448#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {127448#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {127448#true} assume !(0 != ~p1~0); {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {127448#true} assume !(0 != ~p2~0); {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {127448#true} assume !(0 != ~p3~0); {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {127448#true} assume !(0 != ~p4~0); {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {127448#true} assume !(0 != ~p5~0); {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {127448#true} assume !(0 != ~p6~0); {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {127448#true} assume !(0 != ~p7~0); {127448#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {127448#true} assume 0 != ~p8~0;~lk8~0 := 1; {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {127453#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {127453#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {127453#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {127453#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {127453#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {127453#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {127453#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {127453#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {127453#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {127453#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {127453#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {127453#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {127453#(= main_~lk8~0 1)} assume 0 != ~p8~0; {127453#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:02,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {127453#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {127449#false} is VALID [2022-04-27 15:10:02,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {127449#false} assume !false; {127449#false} is VALID [2022-04-27 15:10:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:02,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282513275] [2022-04-27 15:10:02,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282513275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:02,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:02,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:02,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871193870] [2022-04-27 15:10:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 15:10:02,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:02,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:02,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:02,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:02,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:02,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:02,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:02,738 INFO L87 Difference]: Start difference. First operand 4937 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:05,126 INFO L93 Difference]: Finished difference Result 8717 states and 13513 transitions. [2022-04-27 15:10:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:05,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 15:10:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 15:10:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 15:10:05,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-27 15:10:05,256 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:07,652 INFO L225 Difference]: With dead ends: 8717 [2022-04-27 15:10:07,652 INFO L226 Difference]: Without dead ends: 8715 [2022-04-27 15:10:07,653 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:07,662 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:07,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2022-04-27 15:10:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 7177. [2022-04-27 15:10:07,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:07,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:07,771 INFO L74 IsIncluded]: Start isIncluded. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:07,778 INFO L87 Difference]: Start difference. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:09,957 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-27 15:10:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-27 15:10:09,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:09,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:09,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8715 states. [2022-04-27 15:10:09,976 INFO L87 Difference]: Start difference. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8715 states. [2022-04-27 15:10:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:11,865 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-27 15:10:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-27 15:10:11,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:11,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:11,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:11,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 10567 transitions. [2022-04-27 15:10:13,471 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 10567 transitions. Word has length 31 [2022-04-27 15:10:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:13,471 INFO L495 AbstractCegarLoop]: Abstraction has 7177 states and 10567 transitions. [2022-04-27 15:10:13,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 10567 transitions. [2022-04-27 15:10:13,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:10:13,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:13,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:13,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:10:13,475 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 1 times [2022-04-27 15:10:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:13,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384140071] [2022-04-27 15:10:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:13,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:13,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {161188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {161182#true} is VALID [2022-04-27 15:10:13,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {161182#true} assume true; {161182#true} is VALID [2022-04-27 15:10:13,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161182#true} {161182#true} #251#return; {161182#true} is VALID [2022-04-27 15:10:13,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {161182#true} call ULTIMATE.init(); {161188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:13,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {161188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {161182#true} is VALID [2022-04-27 15:10:13,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {161182#true} assume true; {161182#true} is VALID [2022-04-27 15:10:13,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161182#true} {161182#true} #251#return; {161182#true} is VALID [2022-04-27 15:10:13,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {161182#true} call #t~ret18 := main(); {161182#true} is VALID [2022-04-27 15:10:13,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {161182#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {161182#true} is VALID [2022-04-27 15:10:13,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {161182#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {161182#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {161182#true} assume !(0 != ~p1~0); {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {161182#true} assume !(0 != ~p2~0); {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {161182#true} assume !(0 != ~p3~0); {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {161182#true} assume !(0 != ~p4~0); {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {161182#true} assume !(0 != ~p5~0); {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {161182#true} assume !(0 != ~p6~0); {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {161182#true} assume !(0 != ~p7~0); {161182#true} is VALID [2022-04-27 15:10:13,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {161182#true} assume !(0 != ~p8~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {161187#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {161187#(= main_~p8~0 0)} assume !(0 != ~p10~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {161187#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {161187#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {161187#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {161187#(= main_~p8~0 0)} assume !(0 != ~p1~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {161187#(= main_~p8~0 0)} assume !(0 != ~p2~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {161187#(= main_~p8~0 0)} assume !(0 != ~p3~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {161187#(= main_~p8~0 0)} assume !(0 != ~p4~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {161187#(= main_~p8~0 0)} assume !(0 != ~p5~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {161187#(= main_~p8~0 0)} assume !(0 != ~p6~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {161187#(= main_~p8~0 0)} assume !(0 != ~p7~0); {161187#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:13,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {161187#(= main_~p8~0 0)} assume 0 != ~p8~0; {161183#false} is VALID [2022-04-27 15:10:13,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {161183#false} assume 1 != ~lk8~0; {161183#false} is VALID [2022-04-27 15:10:13,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {161183#false} assume !false; {161183#false} is VALID [2022-04-27 15:10:13,528 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:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:13,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384140071] [2022-04-27 15:10:13,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384140071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:13,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:13,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:13,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000829651] [2022-04-27 15:10:13,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:13,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 15:10:13,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:13,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:13,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:13,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:13,550 INFO L87 Difference]: Start difference. First operand 7177 states and 10567 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:21,592 INFO L93 Difference]: Finished difference Result 16653 states and 24649 transitions. [2022-04-27 15:10:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 15:10:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-27 15:10:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-27 15:10:21,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 225 transitions. [2022-04-27 15:10:21,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,498 INFO L225 Difference]: With dead ends: 16653 [2022-04-27 15:10:24,499 INFO L226 Difference]: Without dead ends: 9611 [2022-04-27 15:10:24,503 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:24,504 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:24,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 133 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2022-04-27 15:10:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9609. [2022-04-27 15:10:24,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:24,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,654 INFO L74 IsIncluded]: Start isIncluded. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,666 INFO L87 Difference]: Start difference. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,285 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-27 15:10:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-27 15:10:27,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9611 states. [2022-04-27 15:10:27,314 INFO L87 Difference]: Start difference. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9611 states. [2022-04-27 15:10:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,960 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-27 15:10:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-27 15:10:29,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:29,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 14087 transitions. [2022-04-27 15:10:32,425 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 14087 transitions. Word has length 31 [2022-04-27 15:10:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:32,425 INFO L495 AbstractCegarLoop]: Abstraction has 9609 states and 14087 transitions. [2022-04-27 15:10:32,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 14087 transitions. [2022-04-27 15:10:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:10:32,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:32,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:32,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:10:32,431 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:32,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 1 times [2022-04-27 15:10:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:32,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526635354] [2022-04-27 15:10:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:32,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {207338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {207332#true} is VALID [2022-04-27 15:10:32,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {207332#true} assume true; {207332#true} is VALID [2022-04-27 15:10:32,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207332#true} {207332#true} #251#return; {207332#true} is VALID [2022-04-27 15:10:32,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {207332#true} call ULTIMATE.init(); {207338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:32,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {207338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {207332#true} is VALID [2022-04-27 15:10:32,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {207332#true} assume true; {207332#true} is VALID [2022-04-27 15:10:32,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207332#true} {207332#true} #251#return; {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {207332#true} call #t~ret18 := main(); {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {207332#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {207332#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {207332#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {207332#true} assume !(0 != ~p1~0); {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {207332#true} assume !(0 != ~p2~0); {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {207332#true} assume !(0 != ~p3~0); {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {207332#true} assume !(0 != ~p4~0); {207332#true} is VALID [2022-04-27 15:10:32,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {207332#true} assume !(0 != ~p5~0); {207332#true} is VALID [2022-04-27 15:10:32,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {207332#true} assume !(0 != ~p6~0); {207332#true} is VALID [2022-04-27 15:10:32,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {207332#true} assume !(0 != ~p7~0); {207332#true} is VALID [2022-04-27 15:10:32,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {207332#true} assume 0 != ~p8~0;~lk8~0 := 1; {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {207337#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {207337#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {207337#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {207337#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {207337#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:32,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {207337#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {207333#false} is VALID [2022-04-27 15:10:32,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {207333#false} assume 0 != ~p9~0; {207333#false} is VALID [2022-04-27 15:10:32,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {207333#false} assume 1 != ~lk9~0; {207333#false} is VALID [2022-04-27 15:10:32,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {207333#false} assume !false; {207333#false} is VALID [2022-04-27 15:10:32,475 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,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:32,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526635354] [2022-04-27 15:10:32,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526635354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:32,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:32,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252566247] [2022-04-27 15:10:32,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:32,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 15:10:32,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:32,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:32,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:32,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:32,512 INFO L87 Difference]: Start difference. First operand 9609 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:38,436 INFO L93 Difference]: Finished difference Result 14413 states and 21065 transitions. [2022-04-27 15:10:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:38,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 15:10:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-27 15:10:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-27 15:10:38,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-27 15:10:38,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:41,420 INFO L225 Difference]: With dead ends: 14413 [2022-04-27 15:10:41,420 INFO L226 Difference]: Without dead ends: 9739 [2022-04-27 15:10:41,423 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:41,424 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:41,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 122 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2022-04-27 15:10:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 9737. [2022-04-27 15:10:41,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:41,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:41,569 INFO L74 IsIncluded]: Start isIncluded. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:41,580 INFO L87 Difference]: Start difference. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:44,020 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-27 15:10:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-27 15:10:44,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:44,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:44,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9739 states. [2022-04-27 15:10:44,043 INFO L87 Difference]: Start difference. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9739 states. [2022-04-27 15:10:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:46,523 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-27 15:10:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-27 15:10:46,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:46,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:46,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:46,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 14087 transitions. [2022-04-27 15:10:49,155 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 14087 transitions. Word has length 32 [2022-04-27 15:10:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:49,155 INFO L495 AbstractCegarLoop]: Abstraction has 9737 states and 14087 transitions. [2022-04-27 15:10:49,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 14087 transitions. [2022-04-27 15:10:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:10:49,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:49,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:49,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:10:49,160 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 1 times [2022-04-27 15:10:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:49,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796603115] [2022-04-27 15:10:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:49,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {251632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {251626#true} is VALID [2022-04-27 15:10:49,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {251626#true} assume true; {251626#true} is VALID [2022-04-27 15:10:49,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251626#true} {251626#true} #251#return; {251626#true} is VALID [2022-04-27 15:10:49,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {251626#true} call ULTIMATE.init(); {251632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:49,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {251632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {251626#true} is VALID [2022-04-27 15:10:49,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {251626#true} assume true; {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251626#true} {251626#true} #251#return; {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {251626#true} call #t~ret18 := main(); {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {251626#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {251626#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {251626#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {251626#true} assume !(0 != ~p1~0); {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {251626#true} assume !(0 != ~p2~0); {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {251626#true} assume !(0 != ~p3~0); {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {251626#true} assume !(0 != ~p4~0); {251626#true} is VALID [2022-04-27 15:10:49,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {251626#true} assume !(0 != ~p5~0); {251626#true} is VALID [2022-04-27 15:10:49,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {251626#true} assume !(0 != ~p6~0); {251626#true} is VALID [2022-04-27 15:10:49,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {251626#true} assume !(0 != ~p7~0); {251626#true} is VALID [2022-04-27 15:10:49,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {251626#true} assume !(0 != ~p8~0); {251626#true} is VALID [2022-04-27 15:10:49,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {251626#true} assume 0 != ~p9~0;~lk9~0 := 1; {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {251631#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {251631#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {251631#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {251631#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {251631#(= main_~lk9~0 1)} assume 0 != ~p9~0; {251631#(= main_~lk9~0 1)} is VALID [2022-04-27 15:10:49,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {251631#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {251627#false} is VALID [2022-04-27 15:10:49,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {251627#false} assume !false; {251627#false} is VALID [2022-04-27 15:10:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:49,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796603115] [2022-04-27 15:10:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796603115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:49,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:49,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196977165] [2022-04-27 15:10:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:49,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 15:10:49,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:49,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:49,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:49,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:49,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:49,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:49,224 INFO L87 Difference]: Start difference. First operand 9737 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:56,716 INFO L93 Difference]: Finished difference Result 16909 states and 24969 transitions. [2022-04-27 15:10:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:56,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 15:10:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-27 15:10:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-27 15:10:56,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-27 15:10:56,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:05,060 INFO L225 Difference]: With dead ends: 16909 [2022-04-27 15:11:05,061 INFO L226 Difference]: Without dead ends: 16907 [2022-04-27 15:11:05,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:11:05,063 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:05,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:11:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states. [2022-04-27 15:11:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 14345. [2022-04-27 15:11:05,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:05,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:05,267 INFO L74 IsIncluded]: Start isIncluded. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:05,282 INFO L87 Difference]: Start difference. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:12,419 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-27 15:11:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-27 15:11:12,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:12,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:12,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16907 states. [2022-04-27 15:11:12,449 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16907 states. [2022-04-27 15:11:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:19,842 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-27 15:11:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-27 15:11:19,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:19,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:19,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:19,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 20103 transitions. [2022-04-27 15:11:25,483 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 20103 transitions. Word has length 32 [2022-04-27 15:11:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:25,483 INFO L495 AbstractCegarLoop]: Abstraction has 14345 states and 20103 transitions. [2022-04-27 15:11:25,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 20103 transitions. [2022-04-27 15:11:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:11:25,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:25,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:11:25,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:11:25,489 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 1 times [2022-04-27 15:11:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:25,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669067504] [2022-04-27 15:11:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:25,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {317494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {317488#true} is VALID [2022-04-27 15:11:25,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {317488#true} assume true; {317488#true} is VALID [2022-04-27 15:11:25,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {317488#true} {317488#true} #251#return; {317488#true} is VALID [2022-04-27 15:11:25,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {317488#true} call ULTIMATE.init(); {317494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:25,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {317494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {317488#true} assume true; {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {317488#true} {317488#true} #251#return; {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {317488#true} call #t~ret18 := main(); {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {317488#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {317488#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {317488#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {317488#true} assume !(0 != ~p1~0); {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {317488#true} assume !(0 != ~p2~0); {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {317488#true} assume !(0 != ~p3~0); {317488#true} is VALID [2022-04-27 15:11:25,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {317488#true} assume !(0 != ~p4~0); {317488#true} is VALID [2022-04-27 15:11:25,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {317488#true} assume !(0 != ~p5~0); {317488#true} is VALID [2022-04-27 15:11:25,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {317488#true} assume !(0 != ~p6~0); {317488#true} is VALID [2022-04-27 15:11:25,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {317488#true} assume !(0 != ~p7~0); {317488#true} is VALID [2022-04-27 15:11:25,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {317488#true} assume !(0 != ~p8~0); {317488#true} is VALID [2022-04-27 15:11:25,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {317488#true} assume !(0 != ~p9~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p10~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {317493#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {317493#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {317493#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p1~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p2~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p3~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p4~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p5~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p6~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p7~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {317493#(= main_~p9~0 0)} assume !(0 != ~p8~0); {317493#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:25,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {317493#(= main_~p9~0 0)} assume 0 != ~p9~0; {317489#false} is VALID [2022-04-27 15:11:25,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {317489#false} assume 1 != ~lk9~0; {317489#false} is VALID [2022-04-27 15:11:25,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {317489#false} assume !false; {317489#false} is VALID [2022-04-27 15:11:25,526 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:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669067504] [2022-04-27 15:11:25,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669067504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:25,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:25,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935108023] [2022-04-27 15:11:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 15:11:25,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:25,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:25,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:25,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:25,547 INFO L87 Difference]: Start difference. First operand 14345 states and 20103 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:54,960 INFO L93 Difference]: Finished difference Result 33037 states and 46473 transitions. [2022-04-27 15:11:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:54,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 15:11:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-27 15:11:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-27 15:11:54,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-27 15:11:55,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:12:05,443 INFO L225 Difference]: With dead ends: 33037 [2022-04-27 15:12:05,443 INFO L226 Difference]: Without dead ends: 18955 [2022-04-27 15:12:05,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:12:05,452 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:12:05,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 135 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:12:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2022-04-27 15:12:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 18953. [2022-04-27 15:12:05,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:12:05,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:05,676 INFO L74 IsIncluded]: Start isIncluded. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:05,697 INFO L87 Difference]: Start difference. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:14,960 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-27 15:12:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-27 15:12:14,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:12:14,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:12:14,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18955 states. [2022-04-27 15:12:15,009 INFO L87 Difference]: Start difference. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18955 states. [2022-04-27 15:12:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:24,686 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-27 15:12:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-27 15:12:24,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:12:24,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:12:24,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:12:24,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:12:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18953 states to 18953 states and 26375 transitions. [2022-04-27 15:12:34,043 INFO L78 Accepts]: Start accepts. Automaton has 18953 states and 26375 transitions. Word has length 32 [2022-04-27 15:12:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:12:34,043 INFO L495 AbstractCegarLoop]: Abstraction has 18953 states and 26375 transitions. [2022-04-27 15:12:34,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18953 states and 26375 transitions. [2022-04-27 15:12:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:12:34,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:12:34,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:12:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:12:34,051 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:12:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:12:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 1 times [2022-04-27 15:12:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:12:34,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795394817] [2022-04-27 15:12:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:12:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:12:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:12:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:12:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:12:34,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {408700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {408694#true} is VALID [2022-04-27 15:12:34,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {408694#true} assume true; {408694#true} is VALID [2022-04-27 15:12:34,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {408694#true} {408694#true} #251#return; {408694#true} is VALID [2022-04-27 15:12:34,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {408694#true} call ULTIMATE.init(); {408700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:12:34,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {408700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {408694#true} is VALID [2022-04-27 15:12:34,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {408694#true} assume true; {408694#true} is VALID [2022-04-27 15:12:34,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {408694#true} {408694#true} #251#return; {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {408694#true} call #t~ret18 := main(); {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {408694#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {408694#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {408694#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {408694#true} assume !(0 != ~p1~0); {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {408694#true} assume !(0 != ~p2~0); {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {408694#true} assume !(0 != ~p3~0); {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {408694#true} assume !(0 != ~p4~0); {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {408694#true} assume !(0 != ~p5~0); {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {408694#true} assume !(0 != ~p6~0); {408694#true} is VALID [2022-04-27 15:12:34,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {408694#true} assume !(0 != ~p7~0); {408694#true} is VALID [2022-04-27 15:12:34,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {408694#true} assume !(0 != ~p8~0); {408694#true} is VALID [2022-04-27 15:12:34,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {408694#true} assume 0 != ~p9~0;~lk9~0 := 1; {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {408699#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {408699#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {408699#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {408699#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:12:34,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {408699#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {408695#false} is VALID [2022-04-27 15:12:34,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {408695#false} assume 0 != ~p10~0; {408695#false} is VALID [2022-04-27 15:12:34,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {408695#false} assume 1 != ~lk10~0; {408695#false} is VALID [2022-04-27 15:12:34,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {408695#false} assume !false; {408695#false} is VALID [2022-04-27 15:12:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:12:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:12:34,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795394817] [2022-04-27 15:12:34,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795394817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:12:34,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:12:34,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:12:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198898566] [2022-04-27 15:12:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:12:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 15:12:34,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:12:34,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:34,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:12:34,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:12:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:12:34,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:12:34,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:12:34,114 INFO L87 Difference]: Start difference. First operand 18953 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:55,698 INFO L93 Difference]: Finished difference Result 28429 states and 39433 transitions. [2022-04-27 15:12:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:12:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 15:12:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:12:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-27 15:12:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-27 15:12:55,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-27 15:12:55,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:05,898 INFO L225 Difference]: With dead ends: 28429 [2022-04-27 15:13:05,898 INFO L226 Difference]: Without dead ends: 19211 [2022-04-27 15:13:05,904 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:13:05,905 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:13:05,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:13:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states. [2022-04-27 15:13:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19209. [2022-04-27 15:13:06,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:13:06,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:06,180 INFO L74 IsIncluded]: Start isIncluded. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:06,195 INFO L87 Difference]: Start difference. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:15,728 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-27 15:13:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-27 15:13:15,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:15,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:15,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19211 states. [2022-04-27 15:13:15,770 INFO L87 Difference]: Start difference. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19211 states. [2022-04-27 15:13:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:24,570 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-27 15:13:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-27 15:13:24,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:24,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:24,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:13:24,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:13:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 26375 transitions. [2022-04-27 15:13:33,729 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 26375 transitions. Word has length 33 [2022-04-27 15:13:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:13:33,730 INFO L495 AbstractCegarLoop]: Abstraction has 19209 states and 26375 transitions. [2022-04-27 15:13:33,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 26375 transitions. [2022-04-27 15:13:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:13:33,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:13:33,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:13:33,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:13:33,736 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:13:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:13:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 1 times [2022-04-27 15:13:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:13:33,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585671641] [2022-04-27 15:13:33,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:13:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:13:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:13:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:13:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:13:33,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {496066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {496060#true} is VALID [2022-04-27 15:13:33,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {496060#true} assume true; {496060#true} is VALID [2022-04-27 15:13:33,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {496060#true} {496060#true} #251#return; {496060#true} is VALID [2022-04-27 15:13:33,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {496060#true} call ULTIMATE.init(); {496066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:13:33,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {496066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {496060#true} is VALID [2022-04-27 15:13:33,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {496060#true} assume true; {496060#true} is VALID [2022-04-27 15:13:33,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {496060#true} {496060#true} #251#return; {496060#true} is VALID [2022-04-27 15:13:33,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {496060#true} call #t~ret18 := main(); {496060#true} is VALID [2022-04-27 15:13:33,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {496060#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {496060#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {496060#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {496060#true} assume !(0 != ~p1~0); {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {496060#true} assume !(0 != ~p2~0); {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {496060#true} assume !(0 != ~p3~0); {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {496060#true} assume !(0 != ~p4~0); {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {496060#true} assume !(0 != ~p5~0); {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {496060#true} assume !(0 != ~p6~0); {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {496060#true} assume !(0 != ~p7~0); {496060#true} is VALID [2022-04-27 15:13:33,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {496060#true} assume !(0 != ~p8~0); {496060#true} is VALID [2022-04-27 15:13:33,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {496060#true} assume !(0 != ~p9~0); {496060#true} is VALID [2022-04-27 15:13:33,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {496060#true} assume !(0 != ~p10~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {496065#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {496065#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {496065#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p1~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p2~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p3~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p4~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p5~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p6~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p7~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p8~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {496065#(= main_~p10~0 0)} assume !(0 != ~p9~0); {496065#(= main_~p10~0 0)} is VALID [2022-04-27 15:13:33,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {496065#(= main_~p10~0 0)} assume 0 != ~p10~0; {496061#false} is VALID [2022-04-27 15:13:33,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {496061#false} assume 1 != ~lk10~0; {496061#false} is VALID [2022-04-27 15:13:33,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {496061#false} assume !false; {496061#false} is VALID [2022-04-27 15:13:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:13:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:13:33,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585671641] [2022-04-27 15:13:33,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585671641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:13:33,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:13:33,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:13:33,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658630383] [2022-04-27 15:13:33,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:13:33,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 15:13:33,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:13:33,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:33,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:33,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:13:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:13:33,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:13:33,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:13:33,794 INFO L87 Difference]: Start difference. First operand 19209 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:15:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:15:29,686 INFO L93 Difference]: Finished difference Result 56077 states and 76041 transitions. [2022-04-27 15:15:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:15:29,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 15:15:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:15:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:15:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-27 15:15:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:15:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-27 15:15:29,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-27 15:15:29,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:16:09,070 INFO L225 Difference]: With dead ends: 56077 [2022-04-27 15:16:09,071 INFO L226 Difference]: Without dead ends: 37387 [2022-04-27 15:16:09,082 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:16:09,083 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:16:09,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 105 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:16:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37387 states. [2022-04-27 15:16:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37387 to 37385. [2022-04-27 15:16:09,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:16:09,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:16:09,837 INFO L74 IsIncluded]: Start isIncluded. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:16:09,873 INFO L87 Difference]: Start difference. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:16:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:16:45,874 INFO L93 Difference]: Finished difference Result 37387 states and 49672 transitions. [2022-04-27 15:16:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 37387 states and 49672 transitions. [2022-04-27 15:16:45,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:16:45,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:16:45,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37387 states. [2022-04-27 15:16:45,962 INFO L87 Difference]: Start difference. First operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37387 states. [2022-04-27 15:17:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:17:31,520 INFO L93 Difference]: Finished difference Result 37387 states and 49672 transitions. [2022-04-27 15:17:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37387 states and 49672 transitions. [2022-04-27 15:17:31,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:17:31,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:17:31,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:17:31,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:17:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:18:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37385 states to 37385 states and 49671 transitions. [2022-04-27 15:18:10,134 INFO L78 Accepts]: Start accepts. Automaton has 37385 states and 49671 transitions. Word has length 33 [2022-04-27 15:18:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:18:10,134 INFO L495 AbstractCegarLoop]: Abstraction has 37385 states and 49671 transitions. [2022-04-27 15:18:10,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:18:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37385 states and 49671 transitions. [2022-04-27 15:18:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:18:10,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:18:10,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:18:10,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:18:10,148 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:18:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:18:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 763738216, now seen corresponding path program 1 times [2022-04-27 15:18:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:18:10,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291856231] [2022-04-27 15:18:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:18:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:18:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:18:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:18:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:18:10,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {666888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {666882#true} is VALID [2022-04-27 15:18:10,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {666882#true} assume true; {666882#true} is VALID [2022-04-27 15:18:10,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {666882#true} {666882#true} #251#return; {666882#true} is VALID [2022-04-27 15:18:10,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {666882#true} call ULTIMATE.init(); {666888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:18:10,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {666888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {666882#true} assume true; {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {666882#true} {666882#true} #251#return; {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {666882#true} call #t~ret18 := main(); {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {666882#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {666882#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {666882#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {666882#true} assume !(0 != ~p1~0); {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {666882#true} assume !(0 != ~p2~0); {666882#true} is VALID [2022-04-27 15:18:10,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {666882#true} assume !(0 != ~p3~0); {666882#true} is VALID [2022-04-27 15:18:10,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {666882#true} assume !(0 != ~p4~0); {666882#true} is VALID [2022-04-27 15:18:10,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {666882#true} assume !(0 != ~p5~0); {666882#true} is VALID [2022-04-27 15:18:10,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {666882#true} assume !(0 != ~p6~0); {666882#true} is VALID [2022-04-27 15:18:10,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {666882#true} assume !(0 != ~p7~0); {666882#true} is VALID [2022-04-27 15:18:10,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {666882#true} assume !(0 != ~p8~0); {666882#true} is VALID [2022-04-27 15:18:10,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {666882#true} assume !(0 != ~p9~0); {666882#true} is VALID [2022-04-27 15:18:10,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {666882#true} assume 0 != ~p10~0;~lk10~0 := 1; {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {666887#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {666887#(= main_~lk10~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {666887#(= main_~lk10~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {666887#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {666887#(= main_~lk10~0 1)} assume 0 != ~p10~0; {666887#(= main_~lk10~0 1)} is VALID [2022-04-27 15:18:10,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {666887#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {666883#false} is VALID [2022-04-27 15:18:10,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {666883#false} assume !false; {666883#false} is VALID [2022-04-27 15:18:10,202 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:18:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:18:10,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291856231] [2022-04-27 15:18:10,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291856231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:18:10,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:18:10,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:18:10,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242902273] [2022-04-27 15:18:10,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:18:10,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 15:18:10,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:18:10,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:18:10,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:18:10,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:18:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:18:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:18:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:18:10,229 INFO L87 Difference]: Start difference. First operand 37385 states and 49671 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:19:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:19:14,448 INFO L93 Difference]: Finished difference Result 41485 states and 56841 transitions. [2022-04-27 15:19:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:19:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 15:19:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:19:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:19:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-04-27 15:19:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:19:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-04-27 15:19:14,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 128 transitions. [2022-04-27 15:19:14,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:20:04,538 INFO L225 Difference]: With dead ends: 41485 [2022-04-27 15:20:04,538 INFO L226 Difference]: Without dead ends: 41483 [2022-04-27 15:20:04,547 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:20:04,547 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:20:04,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 132 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:20:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41483 states. [2022-04-27 15:20:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41483 to 37385. [2022-04-27 15:20:05,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:20:05,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41483 states. Second operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:20:05,224 INFO L74 IsIncluded]: Start isIncluded. First operand 41483 states. Second operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:20:05,264 INFO L87 Difference]: Start difference. First operand 41483 states. Second operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:20:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:20:49,584 INFO L93 Difference]: Finished difference Result 41483 states and 56328 transitions. [2022-04-27 15:20:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 41483 states and 56328 transitions. [2022-04-27 15:20:49,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:20:49,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:20:49,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 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 41483 states. [2022-04-27 15:20:49,709 INFO L87 Difference]: Start difference. First operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 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 41483 states. [2022-04-27 15:21:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:21:44,261 INFO L93 Difference]: Finished difference Result 41483 states and 56328 transitions. [2022-04-27 15:21:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 41483 states and 56328 transitions. [2022-04-27 15:21:44,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:21:44,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:21:44,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:21:44,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:21:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:22:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37385 states to 37385 states and 49159 transitions. [2022-04-27 15:22:21,863 INFO L78 Accepts]: Start accepts. Automaton has 37385 states and 49159 transitions. Word has length 33 [2022-04-27 15:22:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:22:21,863 INFO L495 AbstractCegarLoop]: Abstraction has 37385 states and 49159 transitions. [2022-04-27 15:22:21,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:22:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 37385 states and 49159 transitions. [2022-04-27 15:22:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 15:22:21,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:22:21,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:22:21,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 15:22:21,877 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:22:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:22:21,877 INFO L85 PathProgramCache]: Analyzing trace with hash 612915794, now seen corresponding path program 1 times [2022-04-27 15:22:21,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:22:21,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317829455] [2022-04-27 15:22:21,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:22:21,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:22:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:22:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:22:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:22:21,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {831310#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {831304#true} is VALID [2022-04-27 15:22:21,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {831304#true} assume true; {831304#true} is VALID [2022-04-27 15:22:21,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {831304#true} {831304#true} #251#return; {831304#true} is VALID [2022-04-27 15:22:21,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {831304#true} call ULTIMATE.init(); {831310#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:22:21,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {831310#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {831304#true} is VALID [2022-04-27 15:22:21,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {831304#true} assume true; {831304#true} is VALID [2022-04-27 15:22:21,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831304#true} {831304#true} #251#return; {831304#true} is VALID [2022-04-27 15:22:21,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {831304#true} call #t~ret18 := main(); {831304#true} is VALID [2022-04-27 15:22:21,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {831304#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {831304#true} is VALID [2022-04-27 15:22:21,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {831304#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {831304#true} is VALID [2022-04-27 15:22:21,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {831304#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {831304#true} assume !(0 != ~p1~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {831304#true} assume !(0 != ~p2~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {831304#true} assume !(0 != ~p3~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {831304#true} assume !(0 != ~p4~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {831304#true} assume !(0 != ~p5~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {831304#true} assume !(0 != ~p6~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {831304#true} assume !(0 != ~p7~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {831304#true} assume !(0 != ~p8~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {831304#true} assume !(0 != ~p9~0); {831304#true} is VALID [2022-04-27 15:22:21,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {831304#true} assume !(0 != ~p10~0); {831304#true} is VALID [2022-04-27 15:22:21,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {831304#true} assume 0 != ~p11~0;~lk11~0 := 1; {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {831309#(= main_~lk11~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {831309#(= main_~lk11~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p1~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p2~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p3~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p4~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p5~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p6~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p7~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p8~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p9~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {831309#(= main_~lk11~0 1)} assume !(0 != ~p10~0); {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {831309#(= main_~lk11~0 1)} assume 0 != ~p11~0; {831309#(= main_~lk11~0 1)} is VALID [2022-04-27 15:22:21,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {831309#(= main_~lk11~0 1)} assume 1 != ~lk11~0; {831305#false} is VALID [2022-04-27 15:22:21,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {831305#false} assume !false; {831305#false} is VALID [2022-04-27 15:22:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:22:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:22:21,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317829455] [2022-04-27 15:22:21,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317829455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:22:21,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:22:21,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:22:21,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189039317] [2022-04-27 15:22:21,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:22:21,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-27 15:22:21,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:22:21,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:22:21,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:22:21,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:22:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:22:21,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:22:21,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:22:21,936 INFO L87 Difference]: Start difference. First operand 37385 states and 49159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)