/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:09:02,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:09:02,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:09:02,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:09:02,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:09:02,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:09:02,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:09:02,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:09:02,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:09:02,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:09:02,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:09:02,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:09:02,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:09:02,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:09:02,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:09:02,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:09:02,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:09:02,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:09:02,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:09:02,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:09:02,991 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:09:02,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:09:02,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:09:02,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:09:02,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:09:03,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:09:03,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:09:03,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:09:03,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:09:03,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:09:03,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:09:03,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:09:03,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:09:03,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:09:03,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:09:03,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:09:03,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:09:03,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:09:03,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:09:03,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:09:03,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:09:03,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:09:03,008 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:03,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:09:03,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:09:03,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:09:03,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:09:03,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:09:03,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:09:03,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:09:03,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:09:03,031 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:09:03,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:09:03,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:09:03,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:09:03,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:09:03,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:09:03,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:03,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:09:03,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:09:03,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:09:03,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:09:03,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:09:03,033 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:09:03,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:09:03,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:09:03,034 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:03,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:09:03,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:09:03,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:09:03,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:09:03,243 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:09:03,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2022-04-27 15:09:03,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2330aac2/091089002983463abbb0af496adf89ac/FLAG86192b9e8 [2022-04-27 15:09:03,618 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:09:03,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2022-04-27 15:09:03,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2330aac2/091089002983463abbb0af496adf89ac/FLAG86192b9e8 [2022-04-27 15:09:04,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2330aac2/091089002983463abbb0af496adf89ac [2022-04-27 15:09:04,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:09:04,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:09:04,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:04,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:09:04,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:09:04,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:04" (1/1) ... [2022-04-27 15:09:04,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1e7d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:04, skipping insertion in model container [2022-04-27 15:09:04,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:04" (1/1) ... [2022-04-27 15:09:04,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:09:04,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:09:04,246 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_11.c[4246,4259] [2022-04-27 15:09:04,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:04,254 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:09:04,292 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_11.c[4246,4259] [2022-04-27 15:09:04,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:04,302 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:09:04,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:04 WrapperNode [2022-04-27 15:09:04,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:04,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:09:04,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:09:04,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:09:04,311 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:04" (1/1) ... [2022-04-27 15:09:04,311 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:04" (1/1) ... [2022-04-27 15:09:04,325 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:04" (1/1) ... [2022-04-27 15:09:04,326 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:04" (1/1) ... [2022-04-27 15:09:04,340 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:04" (1/1) ... [2022-04-27 15:09:04,346 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:04" (1/1) ... [2022-04-27 15:09:04,347 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:04" (1/1) ... [2022-04-27 15:09:04,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:09:04,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:09:04,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:09:04,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:09:04,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:04" (1/1) ... [2022-04-27 15:09:04,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:04,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:09:04,378 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:04,403 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:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:09:04,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:09:04,414 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:09:04,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:09:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:09:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:09:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:09:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:09:04,483 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:09:04,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:09:04,678 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:09:04,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:09:04,685 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:09:04,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:04 BoogieIcfgContainer [2022-04-27 15:09:04,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:09:04,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:09:04,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:09:04,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:09:04,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:09:04" (1/3) ... [2022-04-27 15:09:04,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bdec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:04, skipping insertion in model container [2022-04-27 15:09:04,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:04" (2/3) ... [2022-04-27 15:09:04,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bdec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:04, skipping insertion in model container [2022-04-27 15:09:04,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:04" (3/3) ... [2022-04-27 15:09:04,696 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-04-27 15:09:04,709 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:09:04,709 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:09:04,748 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:09:04,757 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@7c9446b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34364fc5 [2022-04-27 15:09:04,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:09:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:09:04,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:04,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:04,769 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 1 times [2022-04-27 15:09:04,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:04,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485021766] [2022-04-27 15:09:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:05,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#(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); {51#true} is VALID [2022-04-27 15:09:05,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-27 15:09:05,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-27 15:09:05,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:05,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#(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); {51#true} is VALID [2022-04-27 15:09:05,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-27 15:09:05,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-27 15:09:05,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret16 := main(); {51#true} is VALID [2022-04-27 15:09:05,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#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;havoc ~cond~0; {51#true} is VALID [2022-04-27 15:09:05,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {51#true} is VALID [2022-04-27 15:09:05,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#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; {51#true} is VALID [2022-04-27 15:09:05,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume 0 != ~p1~0;~lk1~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p1~0; {56#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:05,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {56#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {52#false} is VALID [2022-04-27 15:09:05,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-27 15:09:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:05,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485021766] [2022-04-27 15:09:05,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485021766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:05,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:05,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370317808] [2022-04-27 15:09:05,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:05,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:09:05,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:05,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:05,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:05,075 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,425 INFO L93 Difference]: Finished difference Result 94 states and 163 transitions. [2022-04-27 15:09:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:05,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:09:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:09:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:09:05,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-27 15:09:05,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:05,580 INFO L225 Difference]: With dead ends: 94 [2022-04-27 15:09:05,580 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 15:09:05,582 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:05,586 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 191 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 95 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:05,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 95 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:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 15:09:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-04-27 15:09:05,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:05,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,619 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,621 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,628 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-27 15:09:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-27 15:09:05,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:05,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:05,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 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 79 states. [2022-04-27 15:09:05,630 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 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 79 states. [2022-04-27 15:09:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,637 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-27 15:09:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-27 15:09:05,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:05,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:05,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:05,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-04-27 15:09:05,652 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2022-04-27 15:09:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:05,654 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-04-27 15:09:05,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-04-27 15:09:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:09:05,654 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:05,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:05,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:09:05,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:05,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 1 times [2022-04-27 15:09:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:05,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540807078] [2022-04-27 15:09:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:05,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:05,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#(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); {388#true} is VALID [2022-04-27 15:09:05,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#true} assume true; {388#true} is VALID [2022-04-27 15:09:05,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} #217#return; {388#true} is VALID [2022-04-27 15:09:05,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:05,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#(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); {388#true} is VALID [2022-04-27 15:09:05,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {388#true} assume true; {388#true} is VALID [2022-04-27 15:09:05,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {388#true} {388#true} #217#return; {388#true} is VALID [2022-04-27 15:09:05,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {388#true} call #t~ret16 := main(); {388#true} is VALID [2022-04-27 15:09:05,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {388#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;havoc ~cond~0; {388#true} is VALID [2022-04-27 15:09:05,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {388#true} is VALID [2022-04-27 15:09:05,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {388#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; {388#true} is VALID [2022-04-27 15:09:05,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {388#true} assume !(0 != ~p1~0); {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {393#(= main_~p1~0 0)} assume !(0 != ~p2~0); {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#(= main_~p1~0 0)} assume !(0 != ~p10~0); {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {393#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:05,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {393#(= main_~p1~0 0)} assume 0 != ~p1~0; {389#false} is VALID [2022-04-27 15:09:05,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {389#false} assume 1 != ~lk1~0; {389#false} is VALID [2022-04-27 15:09:05,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {389#false} assume !false; {389#false} is VALID [2022-04-27 15:09:05,711 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:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540807078] [2022-04-27 15:09:05,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540807078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:05,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:05,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632845921] [2022-04-27 15:09:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:05,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:09:05,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:05,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:05,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:05,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:05,738 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,932 INFO L93 Difference]: Finished difference Result 128 states and 233 transitions. [2022-04-27 15:09:05,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:05,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:09:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-27 15:09:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-27 15:09:05,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-27 15:09:06,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:06,074 INFO L225 Difference]: With dead ends: 128 [2022-04-27 15:09:06,074 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 15:09:06,078 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:06,080 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:06,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 103 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 15:09:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-27 15:09:06,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:06,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,099 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,099 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,102 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-27 15:09:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-27 15:09:06,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 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 79 states. [2022-04-27 15:09:06,103 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 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 79 states. [2022-04-27 15:09:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,105 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-27 15:09:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-27 15:09:06,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:06,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2022-04-27 15:09:06,107 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2022-04-27 15:09:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:06,108 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2022-04-27 15:09:06,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2022-04-27 15:09:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:09:06,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:06,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:06,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:09:06,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 1 times [2022-04-27 15:09:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:06,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99326427] [2022-04-27 15:09:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {786#(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); {780#true} is VALID [2022-04-27 15:09:06,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {780#true} assume true; {780#true} is VALID [2022-04-27 15:09:06,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {780#true} {780#true} #217#return; {780#true} is VALID [2022-04-27 15:09:06,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:06,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {786#(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); {780#true} is VALID [2022-04-27 15:09:06,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {780#true} assume true; {780#true} is VALID [2022-04-27 15:09:06,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {780#true} {780#true} #217#return; {780#true} is VALID [2022-04-27 15:09:06,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {780#true} call #t~ret16 := main(); {780#true} is VALID [2022-04-27 15:09:06,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {780#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;havoc ~cond~0; {780#true} is VALID [2022-04-27 15:09:06,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {780#true} is VALID [2022-04-27 15:09:06,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#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; {780#true} is VALID [2022-04-27 15:09:06,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#true} assume 0 != ~p1~0;~lk1~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {785#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {785#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {785#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {785#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {785#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {785#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {785#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {785#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {785#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {785#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {785#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:06,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {785#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {781#false} is VALID [2022-04-27 15:09:06,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#false} assume 0 != ~p2~0; {781#false} is VALID [2022-04-27 15:09:06,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {781#false} assume 1 != ~lk2~0; {781#false} is VALID [2022-04-27 15:09:06,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#false} assume !false; {781#false} is VALID [2022-04-27 15:09:06,178 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:06,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:06,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99326427] [2022-04-27 15:09:06,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99326427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:06,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:06,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731930408] [2022-04-27 15:09:06,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:06,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:09:06,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:06,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:06,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:06,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:06,203 INFO L87 Difference]: Start difference. First operand 77 states and 138 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,344 INFO L93 Difference]: Finished difference Result 118 states and 208 transitions. [2022-04-27 15:09:06,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:06,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:09:06,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-27 15:09:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-27 15:09:06,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-27 15:09:06,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:06,491 INFO L225 Difference]: With dead ends: 118 [2022-04-27 15:09:06,491 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 15:09:06,493 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:06,497 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:06,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 15:09:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-04-27 15:09:06,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:06,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,504 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,504 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,506 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-27 15:09:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-27 15:09:06,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 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 82 states. [2022-04-27 15:09:06,507 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 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 82 states. [2022-04-27 15:09:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,508 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-27 15:09:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-27 15:09:06,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:06,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2022-04-27 15:09:06,511 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2022-04-27 15:09:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:06,511 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2022-04-27 15:09:06,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2022-04-27 15:09:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:09:06,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:06,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:06,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:09:06,512 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:06,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 1 times [2022-04-27 15:09:06,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:06,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010316400] [2022-04-27 15:09:06,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:06,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(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); {1173#true} is VALID [2022-04-27 15:09:06,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 15:09:06,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #217#return; {1173#true} is VALID [2022-04-27 15:09:06,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:06,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(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); {1173#true} is VALID [2022-04-27 15:09:06,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-27 15:09:06,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #217#return; {1173#true} is VALID [2022-04-27 15:09:06,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret16 := main(); {1173#true} is VALID [2022-04-27 15:09:06,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#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;havoc ~cond~0; {1173#true} is VALID [2022-04-27 15:09:06,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1173#true} is VALID [2022-04-27 15:09:06,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#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; {1173#true} is VALID [2022-04-27 15:09:06,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#true} assume !(0 != ~p1~0); {1173#true} is VALID [2022-04-27 15:09:06,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#true} assume !(0 != ~p2~0); {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1178#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:06,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= main_~p2~0 0)} assume 0 != ~p2~0; {1174#false} is VALID [2022-04-27 15:09:06,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {1174#false} assume 1 != ~lk2~0; {1174#false} is VALID [2022-04-27 15:09:06,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 15:09:06,578 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:06,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:06,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010316400] [2022-04-27 15:09:06,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010316400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:06,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:06,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516547417] [2022-04-27 15:09:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:09:06,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:06,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:06,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:06,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:06,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:06,594 INFO L87 Difference]: Start difference. First operand 80 states and 140 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,775 INFO L93 Difference]: Finished difference Result 220 states and 396 transitions. [2022-04-27 15:09:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:06,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:09:06,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-27 15:09:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-27 15:09:06,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-27 15:09:06,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:06,946 INFO L225 Difference]: With dead ends: 220 [2022-04-27 15:09:06,946 INFO L226 Difference]: Without dead ends: 149 [2022-04-27 15:09:06,947 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:06,947 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:06,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 85 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-27 15:09:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-04-27 15:09:06,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:06,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,953 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,953 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,957 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-27 15:09:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-27 15:09:06,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 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 149 states. [2022-04-27 15:09:06,958 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 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 149 states. [2022-04-27 15:09:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,961 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-27 15:09:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-27 15:09:06,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:06,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 261 transitions. [2022-04-27 15:09:06,966 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 261 transitions. Word has length 23 [2022-04-27 15:09:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:06,966 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 261 transitions. [2022-04-27 15:09:06,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 261 transitions. [2022-04-27 15:09:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:09:06,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:06,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:06,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:09:06,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:06,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:06,967 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 1 times [2022-04-27 15:09:06,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:06,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066926185] [2022-04-27 15:09:06,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:06,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:07,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {1880#(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); {1874#true} is VALID [2022-04-27 15:09:07,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1874#true} assume true; {1874#true} is VALID [2022-04-27 15:09:07,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1874#true} {1874#true} #217#return; {1874#true} is VALID [2022-04-27 15:09:07,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {1874#true} call ULTIMATE.init(); {1880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:07,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {1880#(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); {1874#true} is VALID [2022-04-27 15:09:07,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {1874#true} assume true; {1874#true} is VALID [2022-04-27 15:09:07,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1874#true} {1874#true} #217#return; {1874#true} is VALID [2022-04-27 15:09:07,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {1874#true} call #t~ret16 := main(); {1874#true} is VALID [2022-04-27 15:09:07,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {1874#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;havoc ~cond~0; {1874#true} is VALID [2022-04-27 15:09:07,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1874#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1874#true} is VALID [2022-04-27 15:09:07,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1874#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; {1874#true} is VALID [2022-04-27 15:09:07,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {1874#true} assume !(0 != ~p1~0); {1874#true} is VALID [2022-04-27 15:09:07,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {1874#true} assume 0 != ~p2~0;~lk2~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {1879#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {1879#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {1879#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1879#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:07,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {1879#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1875#false} is VALID [2022-04-27 15:09:07,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {1875#false} assume !false; {1875#false} is VALID [2022-04-27 15:09:07,012 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:07,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:07,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066926185] [2022-04-27 15:09:07,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066926185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:07,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:07,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:07,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918821795] [2022-04-27 15:09:07,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:09:07,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:07,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:07,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:07,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:07,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:07,028 INFO L87 Difference]: Start difference. First operand 147 states and 261 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,206 INFO L93 Difference]: Finished difference Result 191 states and 339 transitions. [2022-04-27 15:09:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:09:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-27 15:09:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-27 15:09:07,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-27 15:09:07,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:07,320 INFO L225 Difference]: With dead ends: 191 [2022-04-27 15:09:07,321 INFO L226 Difference]: Without dead ends: 189 [2022-04-27 15:09:07,321 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:07,322 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:07,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-27 15:09:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2022-04-27 15:09:07,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:07,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,330 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,330 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,337 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-27 15:09:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-27 15:09:07,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:07,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:07,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 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 189 states. [2022-04-27 15:09:07,339 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 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 189 states. [2022-04-27 15:09:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,345 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-27 15:09:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-27 15:09:07,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:07,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:07,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:07,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2022-04-27 15:09:07,351 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2022-04-27 15:09:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:07,351 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2022-04-27 15:09:07,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-04-27 15:09:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:07,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:07,352 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:07,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:09:07,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 1 times [2022-04-27 15:09:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:07,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795176134] [2022-04-27 15:09:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:07,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {2632#(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); {2626#true} is VALID [2022-04-27 15:09:07,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {2626#true} assume true; {2626#true} is VALID [2022-04-27 15:09:07,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2626#true} {2626#true} #217#return; {2626#true} is VALID [2022-04-27 15:09:07,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {2626#true} call ULTIMATE.init(); {2632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:07,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {2632#(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); {2626#true} is VALID [2022-04-27 15:09:07,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {2626#true} assume true; {2626#true} is VALID [2022-04-27 15:09:07,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2626#true} {2626#true} #217#return; {2626#true} is VALID [2022-04-27 15:09:07,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {2626#true} call #t~ret16 := main(); {2626#true} is VALID [2022-04-27 15:09:07,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {2626#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;havoc ~cond~0; {2626#true} is VALID [2022-04-27 15:09:07,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {2626#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {2626#true} is VALID [2022-04-27 15:09:07,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {2626#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; {2626#true} is VALID [2022-04-27 15:09:07,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {2626#true} assume !(0 != ~p1~0); {2626#true} is VALID [2022-04-27 15:09:07,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {2626#true} assume !(0 != ~p2~0); {2626#true} is VALID [2022-04-27 15:09:07,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {2626#true} assume 0 != ~p3~0;~lk3~0 := 1; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {2631#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {2631#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {2631#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2631#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {2631#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {2631#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {2631#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {2631#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {2631#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {2631#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {2631#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2631#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:07,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {2631#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2627#false} is VALID [2022-04-27 15:09:07,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {2627#false} assume !false; {2627#false} is VALID [2022-04-27 15:09:07,399 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:07,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:07,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795176134] [2022-04-27 15:09:07,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795176134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:07,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:07,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:07,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773858229] [2022-04-27 15:09:07,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:07,400 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:07,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:07,400 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:07,414 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:07,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:07,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:07,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:07,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:07,416 INFO L87 Difference]: Start difference. First operand 147 states and 259 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:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,594 INFO L93 Difference]: Finished difference Result 275 states and 491 transitions. [2022-04-27 15:09:07,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:07,594 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:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:07,594 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:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-27 15:09:07,595 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:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-27 15:09:07,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-27 15:09:07,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:07,708 INFO L225 Difference]: With dead ends: 275 [2022-04-27 15:09:07,708 INFO L226 Difference]: Without dead ends: 273 [2022-04-27 15:09:07,708 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:07,709 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 171 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:07,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-27 15:09:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 199. [2022-04-27 15:09:07,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:07,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,724 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,725 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,734 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-27 15:09:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-27 15:09:07,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:07,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:07,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 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 273 states. [2022-04-27 15:09:07,735 INFO L87 Difference]: Start difference. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 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 273 states. [2022-04-27 15:09:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,741 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-27 15:09:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-27 15:09:07,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:07,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:07,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:07,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 349 transitions. [2022-04-27 15:09:07,755 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 349 transitions. Word has length 24 [2022-04-27 15:09:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:07,755 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 349 transitions. [2022-04-27 15:09:07,755 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:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 349 transitions. [2022-04-27 15:09:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:07,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:07,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:07,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:09:07,756 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 1 times [2022-04-27 15:09:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:07,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077228603] [2022-04-27 15:09:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:07,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:07,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {3690#(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); {3684#true} is VALID [2022-04-27 15:09:07,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {3684#true} assume true; {3684#true} is VALID [2022-04-27 15:09:07,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3684#true} {3684#true} #217#return; {3684#true} is VALID [2022-04-27 15:09:07,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {3684#true} call ULTIMATE.init(); {3690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:07,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {3690#(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); {3684#true} is VALID [2022-04-27 15:09:07,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {3684#true} assume true; {3684#true} is VALID [2022-04-27 15:09:07,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3684#true} {3684#true} #217#return; {3684#true} is VALID [2022-04-27 15:09:07,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {3684#true} call #t~ret16 := main(); {3684#true} is VALID [2022-04-27 15:09:07,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {3684#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;havoc ~cond~0; {3684#true} is VALID [2022-04-27 15:09:07,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {3684#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {3684#true} is VALID [2022-04-27 15:09:07,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {3684#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; {3684#true} is VALID [2022-04-27 15:09:07,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {3684#true} assume !(0 != ~p1~0); {3684#true} is VALID [2022-04-27 15:09:07,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {3684#true} assume !(0 != ~p2~0); {3684#true} is VALID [2022-04-27 15:09:07,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {3684#true} assume !(0 != ~p3~0); {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {3689#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {3689#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {3689#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {3689#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {3689#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {3689#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {3689#(= main_~p3~0 0)} assume !(0 != ~p10~0); {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {3689#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {3689#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {3689#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3689#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:07,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {3689#(= main_~p3~0 0)} assume 0 != ~p3~0; {3685#false} is VALID [2022-04-27 15:09:07,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {3685#false} assume 1 != ~lk3~0; {3685#false} is VALID [2022-04-27 15:09:07,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {3685#false} assume !false; {3685#false} is VALID [2022-04-27 15:09:07,820 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:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:07,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077228603] [2022-04-27 15:09:07,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077228603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:07,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:07,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278603217] [2022-04-27 15:09:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:07,821 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:07,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:07,821 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:07,835 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:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:07,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:07,836 INFO L87 Difference]: Start difference. First operand 199 states and 349 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:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,018 INFO L93 Difference]: Finished difference Result 471 states and 835 transitions. [2022-04-27 15:09:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:08,019 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:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:08,019 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:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-27 15:09:08,020 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:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-27 15:09:08,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-27 15:09:08,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:08,154 INFO L225 Difference]: With dead ends: 471 [2022-04-27 15:09:08,154 INFO L226 Difference]: Without dead ends: 281 [2022-04-27 15:09:08,154 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:08,155 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:08,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-27 15:09:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2022-04-27 15:09:08,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:08,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,161 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,162 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,166 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-27 15:09:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-27 15:09:08,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 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 281 states. [2022-04-27 15:09:08,168 INFO L87 Difference]: Start difference. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 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 281 states. [2022-04-27 15:09:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,173 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-27 15:09:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-27 15:09:08,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:08,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 487 transitions. [2022-04-27 15:09:08,178 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 487 transitions. Word has length 24 [2022-04-27 15:09:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:08,178 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 487 transitions. [2022-04-27 15:09:08,179 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:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 487 transitions. [2022-04-27 15:09:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:08,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:08,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:08,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:09:08,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:08,180 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 1 times [2022-04-27 15:09:08,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:08,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191215162] [2022-04-27 15:09:08,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:08,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:08,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:08,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {5048#(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); {5042#true} is VALID [2022-04-27 15:09:08,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {5042#true} assume true; {5042#true} is VALID [2022-04-27 15:09:08,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5042#true} {5042#true} #217#return; {5042#true} is VALID [2022-04-27 15:09:08,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {5042#true} call ULTIMATE.init(); {5048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:08,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {5048#(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); {5042#true} is VALID [2022-04-27 15:09:08,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {5042#true} assume true; {5042#true} is VALID [2022-04-27 15:09:08,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5042#true} {5042#true} #217#return; {5042#true} is VALID [2022-04-27 15:09:08,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {5042#true} call #t~ret16 := main(); {5042#true} is VALID [2022-04-27 15:09:08,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {5042#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;havoc ~cond~0; {5042#true} is VALID [2022-04-27 15:09:08,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {5042#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {5042#true} is VALID [2022-04-27 15:09:08,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {5042#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; {5042#true} is VALID [2022-04-27 15:09:08,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {5042#true} assume !(0 != ~p1~0); {5042#true} is VALID [2022-04-27 15:09:08,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {5042#true} assume !(0 != ~p2~0); {5042#true} is VALID [2022-04-27 15:09:08,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {5042#true} assume 0 != ~p3~0;~lk3~0 := 1; {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {5047#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {5047#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {5047#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {5047#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {5047#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {5047#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {5047#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {5047#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {5047#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {5047#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5047#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:08,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {5047#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5043#false} is VALID [2022-04-27 15:09:08,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {5043#false} assume 0 != ~p4~0; {5043#false} is VALID [2022-04-27 15:09:08,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {5043#false} assume 1 != ~lk4~0; {5043#false} is VALID [2022-04-27 15:09:08,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {5043#false} assume !false; {5043#false} is VALID [2022-04-27 15:09:08,228 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:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:08,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191215162] [2022-04-27 15:09:08,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191215162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:08,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:08,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34490803] [2022-04-27 15:09:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:08,229 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:08,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:08,229 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:08,241 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:08,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:08,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:08,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:08,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:08,242 INFO L87 Difference]: Start difference. First operand 279 states and 487 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:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,399 INFO L93 Difference]: Finished difference Result 421 states and 733 transitions. [2022-04-27 15:09:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:08,400 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:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:08,400 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:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-27 15:09:08,402 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:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-27 15:09:08,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-27 15:09:08,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:08,539 INFO L225 Difference]: With dead ends: 421 [2022-04-27 15:09:08,539 INFO L226 Difference]: Without dead ends: 287 [2022-04-27 15:09:08,540 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:08,540 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:08,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 117 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-27 15:09:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-04-27 15:09:08,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:08,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,547 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,547 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,552 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-27 15:09:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-27 15:09:08,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 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 287 states. [2022-04-27 15:09:08,554 INFO L87 Difference]: Start difference. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 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 287 states. [2022-04-27 15:09:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,558 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-27 15:09:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-27 15:09:08,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:08,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 491 transitions. [2022-04-27 15:09:08,565 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 491 transitions. Word has length 25 [2022-04-27 15:09:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:08,566 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 491 transitions. [2022-04-27 15:09:08,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 491 transitions. [2022-04-27 15:09:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:08,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:08,566 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:08,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:09:08,567 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 1 times [2022-04-27 15:09:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:08,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362897495] [2022-04-27 15:09:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:08,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:08,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:08,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {6374#(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); {6368#true} is VALID [2022-04-27 15:09:08,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 15:09:08,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6368#true} {6368#true} #217#return; {6368#true} is VALID [2022-04-27 15:09:08,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:08,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {6374#(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); {6368#true} is VALID [2022-04-27 15:09:08,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 15:09:08,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #217#return; {6368#true} is VALID [2022-04-27 15:09:08,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret16 := main(); {6368#true} is VALID [2022-04-27 15:09:08,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {6368#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;havoc ~cond~0; {6368#true} is VALID [2022-04-27 15:09:08,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {6368#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {6368#true} is VALID [2022-04-27 15:09:08,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {6368#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; {6368#true} is VALID [2022-04-27 15:09:08,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {6368#true} assume !(0 != ~p1~0); {6368#true} is VALID [2022-04-27 15:09:08,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} assume !(0 != ~p2~0); {6368#true} is VALID [2022-04-27 15:09:08,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 != ~p3~0); {6368#true} is VALID [2022-04-27 15:09:08,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume 0 != ~p4~0;~lk4~0 := 1; {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {6373#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {6373#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {6373#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {6373#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {6373#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {6373#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {6373#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {6373#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {6373#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {6373#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {6373#(= main_~lk4~0 1)} assume 0 != ~p4~0; {6373#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:08,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {6373#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {6369#false} is VALID [2022-04-27 15:09:08,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-27 15:09:08,610 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:08,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:08,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362897495] [2022-04-27 15:09:08,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362897495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:08,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:08,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023562154] [2022-04-27 15:09:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:08,611 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:08,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:08,612 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:08,628 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:08,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:08,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:08,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:08,629 INFO L87 Difference]: Start difference. First operand 285 states and 491 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:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,822 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2022-04-27 15:09:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:08,823 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:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:08,823 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:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-27 15:09:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-27 15:09:08,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-27 15:09:08,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:08,936 INFO L225 Difference]: With dead ends: 525 [2022-04-27 15:09:08,936 INFO L226 Difference]: Without dead ends: 523 [2022-04-27 15:09:08,937 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:08,937 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:08,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-27 15:09:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 393. [2022-04-27 15:09:08,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:08,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,945 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,945 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,957 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-27 15:09:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-27 15:09:08,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 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 523 states. [2022-04-27 15:09:08,958 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 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 523 states. [2022-04-27 15:09:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,970 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-27 15:09:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-27 15:09:08,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:08,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 667 transitions. [2022-04-27 15:09:08,979 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 667 transitions. Word has length 25 [2022-04-27 15:09:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:08,979 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 667 transitions. [2022-04-27 15:09:08,980 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:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 667 transitions. [2022-04-27 15:09:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:08,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:08,980 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:08,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:09:08,981 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 1 times [2022-04-27 15:09:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:08,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408458157] [2022-04-27 15:09:08,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {8388#(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); {8382#true} is VALID [2022-04-27 15:09:09,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {8382#true} assume true; {8382#true} is VALID [2022-04-27 15:09:09,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8382#true} {8382#true} #217#return; {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {8382#true} call ULTIMATE.init(); {8388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:09,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {8388#(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); {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {8382#true} assume true; {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8382#true} {8382#true} #217#return; {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {8382#true} call #t~ret16 := main(); {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {8382#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;havoc ~cond~0; {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {8382#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {8382#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; {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {8382#true} assume !(0 != ~p1~0); {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {8382#true} assume !(0 != ~p2~0); {8382#true} is VALID [2022-04-27 15:09:09,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {8382#true} assume !(0 != ~p3~0); {8382#true} is VALID [2022-04-27 15:09:09,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {8382#true} assume !(0 != ~p4~0); {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {8387#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {8387#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {8387#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {8387#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {8387#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {8387#(= main_~p4~0 0)} assume !(0 != ~p10~0); {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {8387#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {8387#(= main_~p4~0 0)} assume !(0 != ~p1~0); {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {8387#(= main_~p4~0 0)} assume !(0 != ~p2~0); {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {8387#(= main_~p4~0 0)} assume !(0 != ~p3~0); {8387#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:09,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {8387#(= main_~p4~0 0)} assume 0 != ~p4~0; {8383#false} is VALID [2022-04-27 15:09:09,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {8383#false} assume 1 != ~lk4~0; {8383#false} is VALID [2022-04-27 15:09:09,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {8383#false} assume !false; {8383#false} is VALID [2022-04-27 15:09:09,018 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:09,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:09,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408458157] [2022-04-27 15:09:09,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408458157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:09,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:09,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036540771] [2022-04-27 15:09:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:09,019 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:09,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:09,019 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:09,031 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:09,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:09,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:09,032 INFO L87 Difference]: Start difference. First operand 393 states and 667 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:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,220 INFO L93 Difference]: Finished difference Result 925 states and 1581 transitions. [2022-04-27 15:09:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:09,220 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:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:09,221 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:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-27 15:09:09,222 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:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-27 15:09:09,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2022-04-27 15:09:09,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:09,364 INFO L225 Difference]: With dead ends: 925 [2022-04-27 15:09:09,364 INFO L226 Difference]: Without dead ends: 547 [2022-04-27 15:09:09,365 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:09,366 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:09,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:09,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-27 15:09:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-04-27 15:09:09,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:09,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,377 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,378 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,391 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-27 15:09:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-27 15:09:09,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:09,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:09,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 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 547 states. [2022-04-27 15:09:09,393 INFO L87 Difference]: Start difference. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 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 547 states. [2022-04-27 15:09:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,405 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-27 15:09:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-27 15:09:09,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:09,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:09,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:09,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 919 transitions. [2022-04-27 15:09:09,418 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 919 transitions. Word has length 25 [2022-04-27 15:09:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:09,419 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 919 transitions. [2022-04-27 15:09:09,419 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:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 919 transitions. [2022-04-27 15:09:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:09,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:09,420 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:09,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:09:09,420 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 1 times [2022-04-27 15:09:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:09,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296391632] [2022-04-27 15:09:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {11018#(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); {11012#true} is VALID [2022-04-27 15:09:09,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {11012#true} assume true; {11012#true} is VALID [2022-04-27 15:09:09,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11012#true} {11012#true} #217#return; {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {11012#true} call ULTIMATE.init(); {11018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:09,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {11018#(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); {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {11012#true} assume true; {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11012#true} {11012#true} #217#return; {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {11012#true} call #t~ret16 := main(); {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {11012#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;havoc ~cond~0; {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {11012#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {11012#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; {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {11012#true} assume !(0 != ~p1~0); {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {11012#true} assume !(0 != ~p2~0); {11012#true} is VALID [2022-04-27 15:09:09,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {11012#true} assume !(0 != ~p3~0); {11012#true} is VALID [2022-04-27 15:09:09,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {11012#true} assume 0 != ~p4~0;~lk4~0 := 1; {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {11017#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {11017#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {11017#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {11017#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {11017#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {11017#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {11017#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {11017#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {11017#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {11017#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {11017#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:09,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {11017#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {11013#false} is VALID [2022-04-27 15:09:09,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {11013#false} assume 0 != ~p5~0; {11013#false} is VALID [2022-04-27 15:09:09,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#false} assume 1 != ~lk5~0; {11013#false} is VALID [2022-04-27 15:09:09,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {11013#false} assume !false; {11013#false} is VALID [2022-04-27 15:09:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:09,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296391632] [2022-04-27 15:09:09,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296391632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:09,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:09,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:09,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674702716] [2022-04-27 15:09:09,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:09,475 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:09,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:09,475 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:09,489 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:09,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:09,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:09,490 INFO L87 Difference]: Start difference. First operand 545 states and 919 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:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,667 INFO L93 Difference]: Finished difference Result 817 states and 1373 transitions. [2022-04-27 15:09:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:09,667 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:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:09,668 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:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-27 15:09:09,670 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:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-27 15:09:09,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-27 15:09:09,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:09,799 INFO L225 Difference]: With dead ends: 817 [2022-04-27 15:09:09,799 INFO L226 Difference]: Without dead ends: 555 [2022-04-27 15:09:09,800 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:09,800 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:09,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 114 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-27 15:09:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2022-04-27 15:09:09,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:09,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,811 INFO L74 IsIncluded]: Start isIncluded. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,812 INFO L87 Difference]: Start difference. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,826 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-27 15:09:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-27 15:09:09,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:09,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:09,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 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 555 states. [2022-04-27 15:09:09,829 INFO L87 Difference]: Start difference. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 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 555 states. [2022-04-27 15:09:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,842 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-27 15:09:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-27 15:09:09,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:09,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:09,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:09,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 919 transitions. [2022-04-27 15:09:09,857 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 919 transitions. Word has length 26 [2022-04-27 15:09:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:09,857 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 919 transitions. [2022-04-27 15:09:09,857 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:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 919 transitions. [2022-04-27 15:09:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:09,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:09,858 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:09,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:09:09,858 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 1 times [2022-04-27 15:09:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:09,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388355517] [2022-04-27 15:09:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:09,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {13564#(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); {13558#true} is VALID [2022-04-27 15:09:09,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {13558#true} assume true; {13558#true} is VALID [2022-04-27 15:09:09,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13558#true} {13558#true} #217#return; {13558#true} is VALID [2022-04-27 15:09:09,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {13558#true} call ULTIMATE.init(); {13564#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:09,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {13564#(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); {13558#true} is VALID [2022-04-27 15:09:09,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {13558#true} assume true; {13558#true} is VALID [2022-04-27 15:09:09,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13558#true} {13558#true} #217#return; {13558#true} is VALID [2022-04-27 15:09:09,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {13558#true} call #t~ret16 := main(); {13558#true} is VALID [2022-04-27 15:09:09,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {13558#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;havoc ~cond~0; {13558#true} is VALID [2022-04-27 15:09:09,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {13558#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {13558#true} is VALID [2022-04-27 15:09:09,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {13558#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; {13558#true} is VALID [2022-04-27 15:09:09,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {13558#true} assume !(0 != ~p1~0); {13558#true} is VALID [2022-04-27 15:09:09,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {13558#true} assume !(0 != ~p2~0); {13558#true} is VALID [2022-04-27 15:09:09,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {13558#true} assume !(0 != ~p3~0); {13558#true} is VALID [2022-04-27 15:09:09,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {13558#true} assume !(0 != ~p4~0); {13558#true} is VALID [2022-04-27 15:09:09,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {13558#true} assume 0 != ~p5~0;~lk5~0 := 1; {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {13563#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {13563#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {13563#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {13563#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {13563#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {13563#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {13563#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {13563#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {13563#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {13563#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {13563#(= main_~lk5~0 1)} assume 0 != ~p5~0; {13563#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:09,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {13563#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {13559#false} is VALID [2022-04-27 15:09:09,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {13559#false} assume !false; {13559#false} is VALID [2022-04-27 15:09:09,903 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:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:09,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388355517] [2022-04-27 15:09:09,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388355517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:09,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:09,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11387735] [2022-04-27 15:09:09,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:09,904 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:09,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:09,905 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:09,917 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:09,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:09,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:09,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:09,919 INFO L87 Difference]: Start difference. First operand 553 states and 919 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:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,088 INFO L93 Difference]: Finished difference Result 1005 states and 1697 transitions. [2022-04-27 15:09:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:10,088 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:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:10,088 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:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-27 15:09:10,089 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:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-27 15:09:10,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-27 15:09:10,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:10,197 INFO L225 Difference]: With dead ends: 1005 [2022-04-27 15:09:10,198 INFO L226 Difference]: Without dead ends: 1003 [2022-04-27 15:09:10,199 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:10,199 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:10,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-27 15:09:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 777. [2022-04-27 15:09:10,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:10,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,214 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,215 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,253 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-27 15:09:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-27 15:09:10,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:10,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:10,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 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 1003 states. [2022-04-27 15:09:10,258 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 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 1003 states. [2022-04-27 15:09:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,298 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-27 15:09:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-27 15:09:10,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:10,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:10,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:10,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1263 transitions. [2022-04-27 15:09:10,324 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1263 transitions. Word has length 26 [2022-04-27 15:09:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:10,324 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1263 transitions. [2022-04-27 15:09:10,324 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:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1263 transitions. [2022-04-27 15:09:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:10,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:10,326 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:10,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:09:10,326 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 1 times [2022-04-27 15:09:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:10,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160225940] [2022-04-27 15:09:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:10,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {17426#(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); {17420#true} is VALID [2022-04-27 15:09:10,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {17420#true} assume true; {17420#true} is VALID [2022-04-27 15:09:10,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17420#true} {17420#true} #217#return; {17420#true} is VALID [2022-04-27 15:09:10,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {17420#true} call ULTIMATE.init(); {17426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:10,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {17426#(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); {17420#true} is VALID [2022-04-27 15:09:10,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {17420#true} assume true; {17420#true} is VALID [2022-04-27 15:09:10,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17420#true} {17420#true} #217#return; {17420#true} is VALID [2022-04-27 15:09:10,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {17420#true} call #t~ret16 := main(); {17420#true} is VALID [2022-04-27 15:09:10,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {17420#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;havoc ~cond~0; {17420#true} is VALID [2022-04-27 15:09:10,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {17420#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {17420#true} is VALID [2022-04-27 15:09:10,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {17420#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; {17420#true} is VALID [2022-04-27 15:09:10,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {17420#true} assume !(0 != ~p1~0); {17420#true} is VALID [2022-04-27 15:09:10,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {17420#true} assume !(0 != ~p2~0); {17420#true} is VALID [2022-04-27 15:09:10,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {17420#true} assume !(0 != ~p3~0); {17420#true} is VALID [2022-04-27 15:09:10,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {17420#true} assume !(0 != ~p4~0); {17420#true} is VALID [2022-04-27 15:09:10,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {17420#true} assume !(0 != ~p5~0); {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {17425#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {17425#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {17425#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {17425#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {17425#(= main_~p5~0 0)} assume !(0 != ~p10~0); {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {17425#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {17425#(= main_~p5~0 0)} assume !(0 != ~p1~0); {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {17425#(= main_~p5~0 0)} assume !(0 != ~p2~0); {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {17425#(= main_~p5~0 0)} assume !(0 != ~p3~0); {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {17425#(= main_~p5~0 0)} assume !(0 != ~p4~0); {17425#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:10,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {17425#(= main_~p5~0 0)} assume 0 != ~p5~0; {17421#false} is VALID [2022-04-27 15:09:10,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {17421#false} assume 1 != ~lk5~0; {17421#false} is VALID [2022-04-27 15:09:10,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {17421#false} assume !false; {17421#false} is VALID [2022-04-27 15:09:10,374 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:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:10,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160225940] [2022-04-27 15:09:10,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160225940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:10,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:10,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:10,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378994846] [2022-04-27 15:09:10,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:10,375 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:10,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:10,375 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:10,388 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:10,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:10,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:10,389 INFO L87 Difference]: Start difference. First operand 777 states and 1263 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:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,625 INFO L93 Difference]: Finished difference Result 1821 states and 2977 transitions. [2022-04-27 15:09:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:10,625 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:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:10,625 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:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-27 15:09:10,627 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:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-27 15:09:10,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 198 transitions. [2022-04-27 15:09:10,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:10,805 INFO L225 Difference]: With dead ends: 1821 [2022-04-27 15:09:10,806 INFO L226 Difference]: Without dead ends: 1067 [2022-04-27 15:09:10,807 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:10,807 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:10,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 111 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-04-27 15:09:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2022-04-27 15:09:10,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:10,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,824 INFO L74 IsIncluded]: Start isIncluded. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,825 INFO L87 Difference]: Start difference. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,858 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-27 15:09:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-27 15:09:10,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:10,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:10,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1067 states. [2022-04-27 15:09:10,862 INFO L87 Difference]: Start difference. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1067 states. [2022-04-27 15:09:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,896 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-27 15:09:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-27 15:09:10,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:10,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:10,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:10,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1719 transitions. [2022-04-27 15:09:10,943 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1719 transitions. Word has length 26 [2022-04-27 15:09:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:10,943 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1719 transitions. [2022-04-27 15:09:10,943 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:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1719 transitions. [2022-04-27 15:09:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:10,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:10,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:10,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:09:10,945 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:10,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 1 times [2022-04-27 15:09:10,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:10,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424358078] [2022-04-27 15:09:10,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:10,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {22552#(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); {22546#true} is VALID [2022-04-27 15:09:10,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {22546#true} assume true; {22546#true} is VALID [2022-04-27 15:09:10,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22546#true} {22546#true} #217#return; {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {22546#true} call ULTIMATE.init(); {22552#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {22552#(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); {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {22546#true} assume true; {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22546#true} {22546#true} #217#return; {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {22546#true} call #t~ret16 := main(); {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {22546#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;havoc ~cond~0; {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {22546#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {22546#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; {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {22546#true} assume !(0 != ~p1~0); {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {22546#true} assume !(0 != ~p2~0); {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {22546#true} assume !(0 != ~p3~0); {22546#true} is VALID [2022-04-27 15:09:10,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {22546#true} assume !(0 != ~p4~0); {22546#true} is VALID [2022-04-27 15:09:10,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {22546#true} assume 0 != ~p5~0;~lk5~0 := 1; {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {22551#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {22551#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {22551#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {22551#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {22551#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {22551#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {22551#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {22551#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {22551#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {22551#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {22551#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:10,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {22551#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {22547#false} is VALID [2022-04-27 15:09:10,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {22547#false} assume 0 != ~p6~0; {22547#false} is VALID [2022-04-27 15:09:10,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {22547#false} assume 1 != ~lk6~0; {22547#false} is VALID [2022-04-27 15:09:10,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {22547#false} assume !false; {22547#false} is VALID [2022-04-27 15:09:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:10,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:10,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424358078] [2022-04-27 15:09:10,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424358078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:10,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:10,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319422401] [2022-04-27 15:09:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:10,975 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:10,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:10,975 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:10,989 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:10,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:10,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:10,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:10,990 INFO L87 Difference]: Start difference. First operand 1065 states and 1719 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:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:11,221 INFO L93 Difference]: Finished difference Result 1597 states and 2569 transitions. [2022-04-27 15:09:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:11,222 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:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:11,222 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:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-27 15:09:11,224 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:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-27 15:09:11,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 193 transitions. [2022-04-27 15:09:11,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:11,369 INFO L225 Difference]: With dead ends: 1597 [2022-04-27 15:09:11,370 INFO L226 Difference]: Without dead ends: 1083 [2022-04-27 15:09:11,370 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:11,371 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:11,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 111 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-04-27 15:09:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2022-04-27 15:09:11,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:11,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,387 INFO L74 IsIncluded]: Start isIncluded. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,387 INFO L87 Difference]: Start difference. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:11,421 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-27 15:09:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-27 15:09:11,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:11,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:11,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1083 states. [2022-04-27 15:09:11,425 INFO L87 Difference]: Start difference. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1083 states. [2022-04-27 15:09:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:11,460 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-27 15:09:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-27 15:09:11,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:11,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:11,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:11,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2022-04-27 15:09:11,499 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2022-04-27 15:09:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:11,499 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2022-04-27 15:09:11,499 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:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2022-04-27 15:09:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:11,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:11,500 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:11,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:09:11,500 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 1 times [2022-04-27 15:09:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:11,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203170581] [2022-04-27 15:09:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:11,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {27502#(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); {27496#true} is VALID [2022-04-27 15:09:11,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {27496#true} assume true; {27496#true} is VALID [2022-04-27 15:09:11,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27496#true} {27496#true} #217#return; {27496#true} is VALID [2022-04-27 15:09:11,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {27496#true} call ULTIMATE.init(); {27502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:11,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {27502#(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); {27496#true} is VALID [2022-04-27 15:09:11,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {27496#true} assume true; {27496#true} is VALID [2022-04-27 15:09:11,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27496#true} {27496#true} #217#return; {27496#true} is VALID [2022-04-27 15:09:11,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {27496#true} call #t~ret16 := main(); {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {27496#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;havoc ~cond~0; {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {27496#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {27496#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; {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {27496#true} assume !(0 != ~p1~0); {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {27496#true} assume !(0 != ~p2~0); {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {27496#true} assume !(0 != ~p3~0); {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {27496#true} assume !(0 != ~p4~0); {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {27496#true} assume !(0 != ~p5~0); {27496#true} is VALID [2022-04-27 15:09:11,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {27496#true} assume 0 != ~p6~0;~lk6~0 := 1; {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {27501#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {27501#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {27501#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {27501#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {27501#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {27501#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {27501#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {27501#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {27501#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {27501#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {27501#(= main_~lk6~0 1)} assume 0 != ~p6~0; {27501#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:11,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {27501#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {27497#false} is VALID [2022-04-27 15:09:11,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {27497#false} assume !false; {27497#false} is VALID [2022-04-27 15:09:11,531 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:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203170581] [2022-04-27 15:09:11,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203170581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:11,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:11,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888234022] [2022-04-27 15:09:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:11,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:11,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:11,532 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:11,545 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:11,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:11,546 INFO L87 Difference]: Start difference. First operand 1081 states and 1719 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:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:11,814 INFO L93 Difference]: Finished difference Result 1933 states and 3129 transitions. [2022-04-27 15:09:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:11,814 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:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:11,814 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:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:09:11,815 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:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:09:11,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-27 15:09:11,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:12,011 INFO L225 Difference]: With dead ends: 1933 [2022-04-27 15:09:12,011 INFO L226 Difference]: Without dead ends: 1931 [2022-04-27 15:09:12,011 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:12,012 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:12,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-27 15:09:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2022-04-27 15:09:12,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:12,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,034 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,036 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:12,140 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-27 15:09:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-27 15:09:12,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:12,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:12,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 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 1931 states. [2022-04-27 15:09:12,157 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 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 1931 states. [2022-04-27 15:09:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:12,282 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-27 15:09:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-27 15:09:12,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:12,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:12,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:12,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2022-04-27 15:09:12,366 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2022-04-27 15:09:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:12,366 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2022-04-27 15:09:12,367 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:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2022-04-27 15:09:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:12,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:12,368 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:12,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:09:12,368 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 1 times [2022-04-27 15:09:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:12,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904514446] [2022-04-27 15:09:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:12,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {34964#(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); {34958#true} is VALID [2022-04-27 15:09:12,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {34958#true} assume true; {34958#true} is VALID [2022-04-27 15:09:12,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34958#true} {34958#true} #217#return; {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {34958#true} call ULTIMATE.init(); {34964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:12,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {34964#(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); {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {34958#true} assume true; {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34958#true} {34958#true} #217#return; {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {34958#true} call #t~ret16 := main(); {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {34958#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;havoc ~cond~0; {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {34958#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {34958#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; {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {34958#true} assume !(0 != ~p1~0); {34958#true} is VALID [2022-04-27 15:09:12,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {34958#true} assume !(0 != ~p2~0); {34958#true} is VALID [2022-04-27 15:09:12,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {34958#true} assume !(0 != ~p3~0); {34958#true} is VALID [2022-04-27 15:09:12,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {34958#true} assume !(0 != ~p4~0); {34958#true} is VALID [2022-04-27 15:09:12,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {34958#true} assume !(0 != ~p5~0); {34958#true} is VALID [2022-04-27 15:09:12,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {34958#true} assume !(0 != ~p6~0); {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {34963#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {34963#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {34963#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {34963#(= main_~p6~0 0)} assume !(0 != ~p10~0); {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {34963#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {34963#(= main_~p6~0 0)} assume !(0 != ~p1~0); {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {34963#(= main_~p6~0 0)} assume !(0 != ~p2~0); {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {34963#(= main_~p6~0 0)} assume !(0 != ~p3~0); {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {34963#(= main_~p6~0 0)} assume !(0 != ~p4~0); {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {34963#(= main_~p6~0 0)} assume !(0 != ~p5~0); {34963#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:12,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {34963#(= main_~p6~0 0)} assume 0 != ~p6~0; {34959#false} is VALID [2022-04-27 15:09:12,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {34959#false} assume 1 != ~lk6~0; {34959#false} is VALID [2022-04-27 15:09:12,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {34959#false} assume !false; {34959#false} is VALID [2022-04-27 15:09:12,403 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:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:12,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904514446] [2022-04-27 15:09:12,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904514446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:12,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:12,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369995177] [2022-04-27 15:09:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:12,404 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:12,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:12,404 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:12,416 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:12,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:12,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:12,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:12,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:12,417 INFO L87 Difference]: Start difference. First operand 1545 states and 2391 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:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:12,989 INFO L93 Difference]: Finished difference Result 3597 states and 5593 transitions. [2022-04-27 15:09:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:12,989 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:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:12,989 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:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-27 15:09:12,990 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:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-27 15:09:12,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-27 15:09:13,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:13,241 INFO L225 Difference]: With dead ends: 3597 [2022-04-27 15:09:13,241 INFO L226 Difference]: Without dead ends: 2091 [2022-04-27 15:09:13,243 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:13,244 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:13,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 113 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-27 15:09:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2022-04-27 15:09:13,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:13,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,274 INFO L74 IsIncluded]: Start isIncluded. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,276 INFO L87 Difference]: Start difference. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:13,403 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-27 15:09:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-27 15:09:13,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:13,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:13,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2091 states. [2022-04-27 15:09:13,412 INFO L87 Difference]: Start difference. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2091 states. [2022-04-27 15:09:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:13,540 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-27 15:09:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-27 15:09:13,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:13,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:13,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:13,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2022-04-27 15:09:13,678 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2022-04-27 15:09:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:13,678 INFO L495 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2022-04-27 15:09:13,678 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:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2022-04-27 15:09:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:13,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:13,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:13,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:09:13,680 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 1 times [2022-04-27 15:09:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:13,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019591419] [2022-04-27 15:09:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:13,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {45018#(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); {45012#true} is VALID [2022-04-27 15:09:13,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {45012#true} assume true; {45012#true} is VALID [2022-04-27 15:09:13,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45012#true} {45012#true} #217#return; {45012#true} is VALID [2022-04-27 15:09:13,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {45012#true} call ULTIMATE.init(); {45018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:13,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {45018#(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); {45012#true} is VALID [2022-04-27 15:09:13,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {45012#true} assume true; {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45012#true} {45012#true} #217#return; {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {45012#true} call #t~ret16 := main(); {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {45012#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;havoc ~cond~0; {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {45012#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {45012#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; {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {45012#true} assume !(0 != ~p1~0); {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {45012#true} assume !(0 != ~p2~0); {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {45012#true} assume !(0 != ~p3~0); {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {45012#true} assume !(0 != ~p4~0); {45012#true} is VALID [2022-04-27 15:09:13,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {45012#true} assume !(0 != ~p5~0); {45012#true} is VALID [2022-04-27 15:09:13,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {45012#true} assume 0 != ~p6~0;~lk6~0 := 1; {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {45017#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {45017#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {45017#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {45017#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {45017#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {45017#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {45017#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {45017#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {45017#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {45017#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {45017#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:13,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {45017#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {45013#false} is VALID [2022-04-27 15:09:13,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {45013#false} assume 0 != ~p7~0; {45013#false} is VALID [2022-04-27 15:09:13,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {45013#false} assume 1 != ~lk7~0; {45013#false} is VALID [2022-04-27 15:09:13,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {45013#false} assume !false; {45013#false} is VALID [2022-04-27 15:09:13,722 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:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:13,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019591419] [2022-04-27 15:09:13,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019591419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:13,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:13,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:13,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493604955] [2022-04-27 15:09:13,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:13,723 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:13,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:13,723 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:13,763 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:13,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:13,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:13,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:13,763 INFO L87 Difference]: Start difference. First operand 2089 states and 3207 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:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:14,207 INFO L93 Difference]: Finished difference Result 3133 states and 4793 transitions. [2022-04-27 15:09:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:14,207 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:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:14,207 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:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-27 15:09:14,208 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:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-27 15:09:14,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-27 15:09:14,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:14,458 INFO L225 Difference]: With dead ends: 3133 [2022-04-27 15:09:14,458 INFO L226 Difference]: Without dead ends: 2123 [2022-04-27 15:09:14,460 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:14,460 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:14,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 108 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-27 15:09:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2022-04-27 15:09:14,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:14,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:14,490 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:14,492 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:14,611 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-27 15:09:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-27 15:09:14,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:14,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:14,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-27 15:09:14,617 INFO L87 Difference]: Start difference. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-27 15:09:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:14,741 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-27 15:09:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-27 15:09:14,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:14,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:14,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:14,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2022-04-27 15:09:14,884 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2022-04-27 15:09:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:14,884 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2022-04-27 15:09:14,885 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:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2022-04-27 15:09:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:14,886 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:14,886 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:14,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:09:14,886 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:14,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 1 times [2022-04-27 15:09:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:14,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741069085] [2022-04-27 15:09:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:14,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {54704#(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); {54698#true} is VALID [2022-04-27 15:09:14,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {54698#true} assume true; {54698#true} is VALID [2022-04-27 15:09:14,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54698#true} {54698#true} #217#return; {54698#true} is VALID [2022-04-27 15:09:14,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {54698#true} call ULTIMATE.init(); {54704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:14,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {54704#(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); {54698#true} is VALID [2022-04-27 15:09:14,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {54698#true} assume true; {54698#true} is VALID [2022-04-27 15:09:14,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54698#true} {54698#true} #217#return; {54698#true} is VALID [2022-04-27 15:09:14,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {54698#true} call #t~ret16 := main(); {54698#true} is VALID [2022-04-27 15:09:14,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {54698#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;havoc ~cond~0; {54698#true} is VALID [2022-04-27 15:09:14,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {54698#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {54698#true} is VALID [2022-04-27 15:09:14,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {54698#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; {54698#true} is VALID [2022-04-27 15:09:14,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {54698#true} assume !(0 != ~p1~0); {54698#true} is VALID [2022-04-27 15:09:14,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {54698#true} assume !(0 != ~p2~0); {54698#true} is VALID [2022-04-27 15:09:14,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {54698#true} assume !(0 != ~p3~0); {54698#true} is VALID [2022-04-27 15:09:14,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {54698#true} assume !(0 != ~p4~0); {54698#true} is VALID [2022-04-27 15:09:14,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {54698#true} assume !(0 != ~p5~0); {54698#true} is VALID [2022-04-27 15:09:14,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {54698#true} assume !(0 != ~p6~0); {54698#true} is VALID [2022-04-27 15:09:14,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {54698#true} assume 0 != ~p7~0;~lk7~0 := 1; {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {54703#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {54703#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {54703#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {54703#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {54703#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {54703#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {54703#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {54703#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {54703#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {54703#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {54703#(= main_~lk7~0 1)} assume 0 != ~p7~0; {54703#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:14,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {54703#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {54699#false} is VALID [2022-04-27 15:09:14,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {54699#false} assume !false; {54699#false} is VALID [2022-04-27 15:09:14,921 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:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:14,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741069085] [2022-04-27 15:09:14,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741069085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:14,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:14,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951717764] [2022-04-27 15:09:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:14,922 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:14,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:14,922 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:14,937 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:14,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:14,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:14,938 INFO L87 Difference]: Start difference. First operand 2121 states and 3207 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:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:15,481 INFO L93 Difference]: Finished difference Result 3725 states and 5737 transitions. [2022-04-27 15:09:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:15,482 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:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:15,482 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:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-27 15:09:15,482 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:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-27 15:09:15,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-27 15:09:15,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:15,949 INFO L225 Difference]: With dead ends: 3725 [2022-04-27 15:09:15,949 INFO L226 Difference]: Without dead ends: 3723 [2022-04-27 15:09:15,950 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:15,950 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:15,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-27 15:09:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2022-04-27 15:09:15,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:15,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:15,993 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:15,995 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:16,346 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-27 15:09:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-27 15:09:16,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:16,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:16,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 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 3723 states. [2022-04-27 15:09:16,354 INFO L87 Difference]: Start difference. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 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 3723 states. [2022-04-27 15:09:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:16,746 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-27 15:09:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-27 15:09:16,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:16,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:16,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:16,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2022-04-27 15:09:17,104 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2022-04-27 15:09:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:17,105 INFO L495 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2022-04-27 15:09:17,105 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:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2022-04-27 15:09:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:17,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:17,107 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:17,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:09:17,107 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 1 times [2022-04-27 15:09:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:17,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836278652] [2022-04-27 15:09:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:17,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:17,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {69174#(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); {69168#true} is VALID [2022-04-27 15:09:17,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {69168#true} assume true; {69168#true} is VALID [2022-04-27 15:09:17,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69168#true} {69168#true} #217#return; {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {69168#true} call ULTIMATE.init(); {69174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {69174#(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); {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {69168#true} assume true; {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69168#true} {69168#true} #217#return; {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {69168#true} call #t~ret16 := main(); {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {69168#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;havoc ~cond~0; {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {69168#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {69168#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; {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {69168#true} assume !(0 != ~p1~0); {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {69168#true} assume !(0 != ~p2~0); {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {69168#true} assume !(0 != ~p3~0); {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {69168#true} assume !(0 != ~p4~0); {69168#true} is VALID [2022-04-27 15:09:17,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {69168#true} assume !(0 != ~p5~0); {69168#true} is VALID [2022-04-27 15:09:17,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {69168#true} assume !(0 != ~p6~0); {69168#true} is VALID [2022-04-27 15:09:17,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {69168#true} assume !(0 != ~p7~0); {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {69173#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {69173#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {69173#(= main_~p7~0 0)} assume !(0 != ~p10~0); {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {69173#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {69173#(= main_~p7~0 0)} assume !(0 != ~p1~0); {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {69173#(= main_~p7~0 0)} assume !(0 != ~p2~0); {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {69173#(= main_~p7~0 0)} assume !(0 != ~p3~0); {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {69173#(= main_~p7~0 0)} assume !(0 != ~p4~0); {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {69173#(= main_~p7~0 0)} assume !(0 != ~p5~0); {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {69173#(= main_~p7~0 0)} assume !(0 != ~p6~0); {69173#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:17,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {69173#(= main_~p7~0 0)} assume 0 != ~p7~0; {69169#false} is VALID [2022-04-27 15:09:17,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {69169#false} assume 1 != ~lk7~0; {69169#false} is VALID [2022-04-27 15:09:17,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {69169#false} assume !false; {69169#false} is VALID [2022-04-27 15:09:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836278652] [2022-04-27 15:09:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836278652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:17,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147056900] [2022-04-27 15:09:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:17,146 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:17,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:17,146 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:17,161 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:17,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:17,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:17,161 INFO L87 Difference]: Start difference. First operand 3081 states and 4519 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:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:18,782 INFO L93 Difference]: Finished difference Result 7117 states and 10473 transitions. [2022-04-27 15:09:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:18,782 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:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:18,782 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:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-27 15:09:18,783 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:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-27 15:09:18,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-27 15:09:18,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:19,374 INFO L225 Difference]: With dead ends: 7117 [2022-04-27 15:09:19,374 INFO L226 Difference]: Without dead ends: 4107 [2022-04-27 15:09:19,378 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:19,378 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:19,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-27 15:09:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2022-04-27 15:09:19,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:19,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:19,438 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:19,440 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:19,922 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-27 15:09:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-27 15:09:19,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:19,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:19,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-27 15:09:19,931 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-27 15:09:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:20,376 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-27 15:09:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-27 15:09:20,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:20,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:20,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:20,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2022-04-27 15:09:20,867 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2022-04-27 15:09:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:20,867 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2022-04-27 15:09:20,867 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:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2022-04-27 15:09:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:20,869 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:20,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:20,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:09:20,870 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:20,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 1 times [2022-04-27 15:09:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:20,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127704562] [2022-04-27 15:09:20,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:20,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:20,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {88956#(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); {88950#true} is VALID [2022-04-27 15:09:20,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {88950#true} assume true; {88950#true} is VALID [2022-04-27 15:09:20,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88950#true} {88950#true} #217#return; {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {88950#true} call ULTIMATE.init(); {88956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:20,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {88956#(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); {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {88950#true} assume true; {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88950#true} {88950#true} #217#return; {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {88950#true} call #t~ret16 := main(); {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {88950#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;havoc ~cond~0; {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {88950#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {88950#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; {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {88950#true} assume !(0 != ~p1~0); {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {88950#true} assume !(0 != ~p2~0); {88950#true} is VALID [2022-04-27 15:09:20,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {88950#true} assume !(0 != ~p3~0); {88950#true} is VALID [2022-04-27 15:09:20,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {88950#true} assume !(0 != ~p4~0); {88950#true} is VALID [2022-04-27 15:09:20,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {88950#true} assume !(0 != ~p5~0); {88950#true} is VALID [2022-04-27 15:09:20,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {88950#true} assume !(0 != ~p6~0); {88950#true} is VALID [2022-04-27 15:09:20,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {88950#true} assume 0 != ~p7~0;~lk7~0 := 1; {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {88955#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {88955#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {88955#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {88955#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {88955#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {88955#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {88955#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {88955#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {88955#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {88955#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {88955#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:20,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {88955#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {88951#false} is VALID [2022-04-27 15:09:20,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {88951#false} assume 0 != ~p8~0; {88951#false} is VALID [2022-04-27 15:09:20,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {88951#false} assume 1 != ~lk8~0; {88951#false} is VALID [2022-04-27 15:09:20,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {88951#false} assume !false; {88951#false} is VALID [2022-04-27 15:09:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:20,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127704562] [2022-04-27 15:09:20,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127704562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:20,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:20,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:20,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888223095] [2022-04-27 15:09:20,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:20,922 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:20,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:20,922 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:20,938 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:20,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:20,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:20,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:20,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:20,939 INFO L87 Difference]: Start difference. First operand 4105 states and 5959 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:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,274 INFO L93 Difference]: Finished difference Result 6157 states and 8905 transitions. [2022-04-27 15:09:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:22,274 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:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:22,275 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:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-27 15:09:22,276 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:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-27 15:09:22,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-27 15:09:22,392 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:22,882 INFO L225 Difference]: With dead ends: 6157 [2022-04-27 15:09:22,883 INFO L226 Difference]: Without dead ends: 4171 [2022-04-27 15:09:22,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:22,885 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 138 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:22,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 105 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-04-27 15:09:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2022-04-27 15:09:22,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:22,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,948 INFO L74 IsIncluded]: Start isIncluded. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,950 INFO L87 Difference]: Start difference. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:23,418 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-27 15:09:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-27 15:09:23,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:23,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:23,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4171 states. [2022-04-27 15:09:23,427 INFO L87 Difference]: Start difference. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4171 states. [2022-04-27 15:09:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:23,908 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-27 15:09:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-27 15:09:23,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:23,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:23,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:23,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2022-04-27 15:09:24,449 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2022-04-27 15:09:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:24,449 INFO L495 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2022-04-27 15:09:24,449 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:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2022-04-27 15:09:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:24,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:24,451 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:24,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:09:24,451 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 1 times [2022-04-27 15:09:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:24,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451651184] [2022-04-27 15:09:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:24,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:24,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {107970#(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); {107964#true} is VALID [2022-04-27 15:09:24,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {107964#true} assume true; {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107964#true} {107964#true} #217#return; {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {107964#true} call ULTIMATE.init(); {107970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:24,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {107970#(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); {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {107964#true} assume true; {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107964#true} {107964#true} #217#return; {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {107964#true} call #t~ret16 := main(); {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {107964#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;havoc ~cond~0; {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {107964#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {107964#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; {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {107964#true} assume !(0 != ~p1~0); {107964#true} is VALID [2022-04-27 15:09:24,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {107964#true} assume !(0 != ~p2~0); {107964#true} is VALID [2022-04-27 15:09:24,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {107964#true} assume !(0 != ~p3~0); {107964#true} is VALID [2022-04-27 15:09:24,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {107964#true} assume !(0 != ~p4~0); {107964#true} is VALID [2022-04-27 15:09:24,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {107964#true} assume !(0 != ~p5~0); {107964#true} is VALID [2022-04-27 15:09:24,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {107964#true} assume !(0 != ~p6~0); {107964#true} is VALID [2022-04-27 15:09:24,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {107964#true} assume !(0 != ~p7~0); {107964#true} is VALID [2022-04-27 15:09:24,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {107964#true} assume 0 != ~p8~0;~lk8~0 := 1; {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {107969#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {107969#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {107969#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {107969#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {107969#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {107969#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {107969#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {107969#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {107969#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {107969#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {107969#(= main_~lk8~0 1)} assume 0 != ~p8~0; {107969#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:24,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {107969#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {107965#false} is VALID [2022-04-27 15:09:24,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {107965#false} assume !false; {107965#false} is VALID [2022-04-27 15:09:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:24,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451651184] [2022-04-27 15:09:24,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451651184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:24,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:24,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932573920] [2022-04-27 15:09:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:24,497 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:24,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:24,497 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:24,510 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:24,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:24,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:24,511 INFO L87 Difference]: Start difference. First operand 4169 states and 5959 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:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:26,115 INFO L93 Difference]: Finished difference Result 7181 states and 10441 transitions. [2022-04-27 15:09:26,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:26,116 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:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:09:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:09:26,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-27 15:09:26,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:27,814 INFO L225 Difference]: With dead ends: 7181 [2022-04-27 15:09:27,814 INFO L226 Difference]: Without dead ends: 7179 [2022-04-27 15:09:27,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:27,815 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:27,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2022-04-27 15:09:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2022-04-27 15:09:27,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:27,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:27,901 INFO L74 IsIncluded]: Start isIncluded. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:27,905 INFO L87 Difference]: Start difference. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:29,364 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-27 15:09:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-27 15:09:29,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:29,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:29,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 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 7179 states. [2022-04-27 15:09:29,379 INFO L87 Difference]: Start difference. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 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 7179 states. [2022-04-27 15:09:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:30,957 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-27 15:09:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-27 15:09:30,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:30,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:30,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:30,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2022-04-27 15:09:32,344 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2022-04-27 15:09:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:32,344 INFO L495 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2022-04-27 15:09:32,344 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:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2022-04-27 15:09:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:32,347 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:32,347 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:32,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:09:32,347 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:32,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:32,347 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 1 times [2022-04-27 15:09:32,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:32,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941961794] [2022-04-27 15:09:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:32,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:32,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {136072#(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); {136066#true} is VALID [2022-04-27 15:09:32,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {136066#true} assume true; {136066#true} is VALID [2022-04-27 15:09:32,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136066#true} {136066#true} #217#return; {136066#true} is VALID [2022-04-27 15:09:32,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {136066#true} call ULTIMATE.init(); {136072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:32,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {136072#(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); {136066#true} is VALID [2022-04-27 15:09:32,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {136066#true} assume true; {136066#true} is VALID [2022-04-27 15:09:32,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136066#true} {136066#true} #217#return; {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {136066#true} call #t~ret16 := main(); {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {136066#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;havoc ~cond~0; {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {136066#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {136066#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; {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {136066#true} assume !(0 != ~p1~0); {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {136066#true} assume !(0 != ~p2~0); {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {136066#true} assume !(0 != ~p3~0); {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {136066#true} assume !(0 != ~p4~0); {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {136066#true} assume !(0 != ~p5~0); {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {136066#true} assume !(0 != ~p6~0); {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {136066#true} assume !(0 != ~p7~0); {136066#true} is VALID [2022-04-27 15:09:32,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {136066#true} assume !(0 != ~p8~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {136071#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {136071#(= main_~p8~0 0)} assume !(0 != ~p10~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {136071#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {136071#(= main_~p8~0 0)} assume !(0 != ~p1~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {136071#(= main_~p8~0 0)} assume !(0 != ~p2~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {136071#(= main_~p8~0 0)} assume !(0 != ~p3~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {136071#(= main_~p8~0 0)} assume !(0 != ~p4~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {136071#(= main_~p8~0 0)} assume !(0 != ~p5~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {136071#(= main_~p8~0 0)} assume !(0 != ~p6~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {136071#(= main_~p8~0 0)} assume !(0 != ~p7~0); {136071#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:32,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {136071#(= main_~p8~0 0)} assume 0 != ~p8~0; {136067#false} is VALID [2022-04-27 15:09:32,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {136067#false} assume 1 != ~lk8~0; {136067#false} is VALID [2022-04-27 15:09:32,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {136067#false} assume !false; {136067#false} is VALID [2022-04-27 15:09:32,380 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:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:32,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941961794] [2022-04-27 15:09:32,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941961794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:32,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:32,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909359045] [2022-04-27 15:09:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:32,381 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:32,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:32,381 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:32,394 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:32,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:32,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:32,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:32,395 INFO L87 Difference]: Start difference. First operand 6153 states and 8519 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:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:38,338 INFO L93 Difference]: Finished difference Result 14093 states and 19529 transitions. [2022-04-27 15:09:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:38,338 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:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:38,339 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:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-27 15:09:38,340 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:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-27 15:09:38,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-27 15:09:38,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:40,283 INFO L225 Difference]: With dead ends: 14093 [2022-04-27 15:09:40,284 INFO L226 Difference]: Without dead ends: 8075 [2022-04-27 15:09:40,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:40,288 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:40,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 117 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2022-04-27 15:09:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2022-04-27 15:09:40,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:40,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,407 INFO L74 IsIncluded]: Start isIncluded. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,413 INFO L87 Difference]: Start difference. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,251 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-27 15:09:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-27 15:09:42,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8075 states. [2022-04-27 15:09:42,268 INFO L87 Difference]: Start difference. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8075 states. [2022-04-27 15:09:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,285 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-27 15:09:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-27 15:09:44,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:44,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:44,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:44,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2022-04-27 15:09:46,620 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2022-04-27 15:09:46,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:46,620 INFO L495 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2022-04-27 15:09:46,620 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:46,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2022-04-27 15:09:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:46,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:46,623 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:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:09:46,623 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 1 times [2022-04-27 15:09:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:46,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576943625] [2022-04-27 15:09:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:46,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {175054#(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); {175048#true} is VALID [2022-04-27 15:09:46,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {175048#true} assume true; {175048#true} is VALID [2022-04-27 15:09:46,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175048#true} {175048#true} #217#return; {175048#true} is VALID [2022-04-27 15:09:46,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {175048#true} call ULTIMATE.init(); {175054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:46,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {175054#(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); {175048#true} is VALID [2022-04-27 15:09:46,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {175048#true} assume true; {175048#true} is VALID [2022-04-27 15:09:46,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175048#true} {175048#true} #217#return; {175048#true} is VALID [2022-04-27 15:09:46,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {175048#true} call #t~ret16 := main(); {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {175048#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;havoc ~cond~0; {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {175048#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {175048#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; {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {175048#true} assume !(0 != ~p1~0); {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {175048#true} assume !(0 != ~p2~0); {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {175048#true} assume !(0 != ~p3~0); {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {175048#true} assume !(0 != ~p4~0); {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {175048#true} assume !(0 != ~p5~0); {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {175048#true} assume !(0 != ~p6~0); {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {175048#true} assume !(0 != ~p7~0); {175048#true} is VALID [2022-04-27 15:09:46,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {175048#true} assume 0 != ~p8~0;~lk8~0 := 1; {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {175053#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {175053#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {175053#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:46,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {175053#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {175049#false} is VALID [2022-04-27 15:09:46,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {175049#false} assume 0 != ~p9~0; {175049#false} is VALID [2022-04-27 15:09:46,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {175049#false} assume 1 != ~lk9~0; {175049#false} is VALID [2022-04-27 15:09:46,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {175049#false} assume !false; {175049#false} is VALID [2022-04-27 15:09:46,679 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:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576943625] [2022-04-27 15:09:46,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576943625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:46,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:46,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216525453] [2022-04-27 15:09:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:46,680 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:46,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:46,680 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:46,697 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:46,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:46,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:46,698 INFO L87 Difference]: Start difference. First operand 8073 states and 11015 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,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:50,826 INFO L93 Difference]: Finished difference Result 12109 states and 16457 transitions. [2022-04-27 15:09:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:50,827 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,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:50,827 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-27 15:09:50,828 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-27 15:09:50,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-27 15:09:50,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:52,823 INFO L225 Difference]: With dead ends: 12109 [2022-04-27 15:09:52,824 INFO L226 Difference]: Without dead ends: 8203 [2022-04-27 15:09:52,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:52,827 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:52,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 102 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2022-04-27 15:09:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2022-04-27 15:09:52,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:52,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,961 INFO L74 IsIncluded]: Start isIncluded. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,968 INFO L87 Difference]: Start difference. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:54,844 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-27 15:09:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-27 15:09:54,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:54,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:54,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8203 states. [2022-04-27 15:09:54,863 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8203 states. [2022-04-27 15:09:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:56,668 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-27 15:09:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-27 15:09:56,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:56,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:56,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:56,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2022-04-27 15:09:58,744 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2022-04-27 15:09:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:58,744 INFO L495 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2022-04-27 15:09:58,744 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:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2022-04-27 15:09:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:58,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:58,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:58,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:09:58,748 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 1 times [2022-04-27 15:09:58,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:58,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674315076] [2022-04-27 15:09:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:58,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {212436#(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); {212430#true} is VALID [2022-04-27 15:09:58,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {212430#true} assume true; {212430#true} is VALID [2022-04-27 15:09:58,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212430#true} {212430#true} #217#return; {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {212430#true} call ULTIMATE.init(); {212436#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:58,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {212436#(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); {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {212430#true} assume true; {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212430#true} {212430#true} #217#return; {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {212430#true} call #t~ret16 := main(); {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {212430#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;havoc ~cond~0; {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {212430#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {212430#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; {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {212430#true} assume !(0 != ~p1~0); {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {212430#true} assume !(0 != ~p2~0); {212430#true} is VALID [2022-04-27 15:09:58,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {212430#true} assume !(0 != ~p3~0); {212430#true} is VALID [2022-04-27 15:09:58,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {212430#true} assume !(0 != ~p4~0); {212430#true} is VALID [2022-04-27 15:09:58,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {212430#true} assume !(0 != ~p5~0); {212430#true} is VALID [2022-04-27 15:09:58,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {212430#true} assume !(0 != ~p6~0); {212430#true} is VALID [2022-04-27 15:09:58,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {212430#true} assume !(0 != ~p7~0); {212430#true} is VALID [2022-04-27 15:09:58,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {212430#true} assume !(0 != ~p8~0); {212430#true} is VALID [2022-04-27 15:09:58,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {212430#true} assume 0 != ~p9~0;~lk9~0 := 1; {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {212435#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {212435#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {212435#(= main_~lk9~0 1)} assume 0 != ~p9~0; {212435#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:58,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {212435#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {212431#false} is VALID [2022-04-27 15:09:58,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {212431#false} assume !false; {212431#false} is VALID [2022-04-27 15:09:58,797 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:58,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:58,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674315076] [2022-04-27 15:09:58,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674315076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:58,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:58,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199128873] [2022-04-27 15:09:58,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:58,799 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:58,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:58,799 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:58,813 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:58,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:58,817 INFO L87 Difference]: Start difference. First operand 8201 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:04,359 INFO L93 Difference]: Finished difference Result 13837 states and 18825 transitions. [2022-04-27 15:10:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:04,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:10:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-27 15:10:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-27 15:10:04,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-27 15:10:04,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:10,332 INFO L225 Difference]: With dead ends: 13837 [2022-04-27 15:10:10,332 INFO L226 Difference]: Without dead ends: 13835 [2022-04-27 15:10:10,333 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:10,334 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:10,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-04-27 15:10:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2022-04-27 15:10:10,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:10,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:10,492 INFO L74 IsIncluded]: Start isIncluded. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:10,504 INFO L87 Difference]: Start difference. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,438 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-27 15:10:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-27 15:10:15,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 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 13835 states. [2022-04-27 15:10:15,466 INFO L87 Difference]: Start difference. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 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 13835 states. [2022-04-27 15:10:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:21,165 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-27 15:10:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-27 15:10:21,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:21,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:21,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:21,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2022-04-27 15:10:25,854 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2022-04-27 15:10:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,854 INFO L495 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2022-04-27 15:10:25,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2022-04-27 15:10:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:10:25,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,862 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:10:25,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:10:25,863 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 1 times [2022-04-27 15:10:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969943681] [2022-04-27 15:10:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {267034#(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); {267028#true} is VALID [2022-04-27 15:10:25,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {267028#true} assume true; {267028#true} is VALID [2022-04-27 15:10:25,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267028#true} {267028#true} #217#return; {267028#true} is VALID [2022-04-27 15:10:25,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {267028#true} call ULTIMATE.init(); {267034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {267034#(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); {267028#true} is VALID [2022-04-27 15:10:25,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {267028#true} assume true; {267028#true} is VALID [2022-04-27 15:10:25,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267028#true} {267028#true} #217#return; {267028#true} is VALID [2022-04-27 15:10:25,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {267028#true} call #t~ret16 := main(); {267028#true} is VALID [2022-04-27 15:10:25,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {267028#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;havoc ~cond~0; {267028#true} is VALID [2022-04-27 15:10:25,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {267028#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {267028#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; {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {267028#true} assume !(0 != ~p1~0); {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {267028#true} assume !(0 != ~p2~0); {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {267028#true} assume !(0 != ~p3~0); {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {267028#true} assume !(0 != ~p4~0); {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {267028#true} assume !(0 != ~p5~0); {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {267028#true} assume !(0 != ~p6~0); {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {267028#true} assume !(0 != ~p7~0); {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {267028#true} assume !(0 != ~p8~0); {267028#true} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {267028#true} assume !(0 != ~p9~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p10~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {267033#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p1~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p2~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p3~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p4~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p5~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p6~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p7~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {267033#(= main_~p9~0 0)} assume !(0 != ~p8~0); {267033#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:25,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {267033#(= main_~p9~0 0)} assume 0 != ~p9~0; {267029#false} is VALID [2022-04-27 15:10:25,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {267029#false} assume 1 != ~lk9~0; {267029#false} is VALID [2022-04-27 15:10:25,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {267029#false} assume !false; {267029#false} is VALID [2022-04-27 15:10:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969943681] [2022-04-27 15:10:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969943681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083864921] [2022-04-27 15:10:25,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:10:25,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,898 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:10:25,915 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:10:25,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,915 INFO L87 Difference]: Start difference. First operand 12297 states and 16007 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:50,313 INFO L93 Difference]: Finished difference Result 27917 states and 36233 transitions. [2022-04-27 15:10:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:10:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-27 15:10:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-27 15:10:50,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-27 15:10:50,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:57,731 INFO L225 Difference]: With dead ends: 27917 [2022-04-27 15:10:57,731 INFO L226 Difference]: Without dead ends: 15883 [2022-04-27 15:10:57,738 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:57,739 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:57,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2022-04-27 15:10:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2022-04-27 15:10:57,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:57,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:57,947 INFO L74 IsIncluded]: Start isIncluded. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:57,962 INFO L87 Difference]: Start difference. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:04,665 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-27 15:11:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-27 15:11:04,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:04,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:04,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 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 15883 states. [2022-04-27 15:11:04,697 INFO L87 Difference]: Start difference. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 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 15883 states. [2022-04-27 15:11:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:11,988 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-27 15:11:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-27 15:11:11,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:11,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:11,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:11,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2022-04-27 15:11:19,050 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2022-04-27 15:11:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:19,050 INFO L495 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2022-04-27 15:11:19,050 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:11:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2022-04-27 15:11:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:11:19,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:19,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:11:19,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:11:19,056 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 1 times [2022-04-27 15:11:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:19,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822847008] [2022-04-27 15:11:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:19,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:19,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {343904#(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); {343898#true} is VALID [2022-04-27 15:11:19,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {343898#true} assume true; {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {343898#true} {343898#true} #217#return; {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {343898#true} call ULTIMATE.init(); {343904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:19,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {343904#(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); {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {343898#true} assume true; {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343898#true} {343898#true} #217#return; {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {343898#true} call #t~ret16 := main(); {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {343898#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;havoc ~cond~0; {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {343898#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {343898#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; {343898#true} is VALID [2022-04-27 15:11:19,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {343898#true} assume !(0 != ~p1~0); {343898#true} is VALID [2022-04-27 15:11:19,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {343898#true} assume !(0 != ~p2~0); {343898#true} is VALID [2022-04-27 15:11:19,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {343898#true} assume !(0 != ~p3~0); {343898#true} is VALID [2022-04-27 15:11:19,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {343898#true} assume !(0 != ~p4~0); {343898#true} is VALID [2022-04-27 15:11:19,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {343898#true} assume !(0 != ~p5~0); {343898#true} is VALID [2022-04-27 15:11:19,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {343898#true} assume !(0 != ~p6~0); {343898#true} is VALID [2022-04-27 15:11:19,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {343898#true} assume !(0 != ~p7~0); {343898#true} is VALID [2022-04-27 15:11:19,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {343898#true} assume !(0 != ~p8~0); {343898#true} is VALID [2022-04-27 15:11:19,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {343898#true} assume 0 != ~p9~0;~lk9~0 := 1; {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {343903#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {343903#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:11:19,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {343903#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {343899#false} is VALID [2022-04-27 15:11:19,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {343899#false} assume 0 != ~p10~0; {343899#false} is VALID [2022-04-27 15:11:19,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {343899#false} assume 1 != ~lk10~0; {343899#false} is VALID [2022-04-27 15:11:19,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {343899#false} assume !false; {343899#false} is VALID [2022-04-27 15:11:19,112 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:19,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:19,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822847008] [2022-04-27 15:11:19,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822847008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:19,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:19,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:19,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561950020] [2022-04-27 15:11:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:19,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 15:11:19,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:19,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:19,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:19,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:19,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:19,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:19,129 INFO L87 Difference]: Start difference. First operand 15881 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:33,574 INFO L93 Difference]: Finished difference Result 23821 states and 30217 transitions. [2022-04-27 15:11:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 15:11:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-27 15:11:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-27 15:11:33,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-27 15:11:33,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:41,085 INFO L225 Difference]: With dead ends: 23821 [2022-04-27 15:11:41,086 INFO L226 Difference]: Without dead ends: 16139 [2022-04-27 15:11:41,091 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:41,091 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:41,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:11:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2022-04-27 15:11:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2022-04-27 15:11:41,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:41,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:41,291 INFO L74 IsIncluded]: Start isIncluded. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:41,305 INFO L87 Difference]: Start difference. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:48,729 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-27 15:11:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-27 15:11:48,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:48,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:48,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 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 16139 states. [2022-04-27 15:11:48,767 INFO L87 Difference]: Start difference. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 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 16139 states. [2022-04-27 15:11:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:55,245 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-27 15:11:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-27 15:11:55,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:55,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:55,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:55,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2022-04-27 15:12:02,221 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2022-04-27 15:12:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:12:02,221 INFO L495 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2022-04-27 15:12:02,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2022-04-27 15:12:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:12:02,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:12:02,238 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:12:02,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:12:02,238 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:12:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:12:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 1 times [2022-04-27 15:12:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:12:02,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070967612] [2022-04-27 15:12:02,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:12:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:12:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:12:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:12:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:12:02,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {417446#(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); {417440#true} is VALID [2022-04-27 15:12:02,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {417440#true} assume true; {417440#true} is VALID [2022-04-27 15:12:02,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417440#true} {417440#true} #217#return; {417440#true} is VALID [2022-04-27 15:12:02,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {417440#true} call ULTIMATE.init(); {417446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:12:02,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {417446#(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); {417440#true} is VALID [2022-04-27 15:12:02,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {417440#true} assume true; {417440#true} is VALID [2022-04-27 15:12:02,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417440#true} {417440#true} #217#return; {417440#true} is VALID [2022-04-27 15:12:02,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {417440#true} call #t~ret16 := main(); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {417440#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;havoc ~cond~0; {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {417440#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {417440#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; {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {417440#true} assume !(0 != ~p1~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {417440#true} assume !(0 != ~p2~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {417440#true} assume !(0 != ~p3~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {417440#true} assume !(0 != ~p4~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {417440#true} assume !(0 != ~p5~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {417440#true} assume !(0 != ~p6~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {417440#true} assume !(0 != ~p7~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {417440#true} assume !(0 != ~p8~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {417440#true} assume !(0 != ~p9~0); {417440#true} is VALID [2022-04-27 15:12:02,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {417440#true} assume !(0 != ~p10~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {417445#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p1~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p2~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p3~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p4~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p5~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p6~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p7~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p8~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {417445#(= main_~p10~0 0)} assume !(0 != ~p9~0); {417445#(= main_~p10~0 0)} is VALID [2022-04-27 15:12:02,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {417445#(= main_~p10~0 0)} assume 0 != ~p10~0; {417441#false} is VALID [2022-04-27 15:12:02,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {417441#false} assume 1 != ~lk10~0; {417441#false} is VALID [2022-04-27 15:12:02,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {417441#false} assume !false; {417441#false} is VALID [2022-04-27 15:12:02,276 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:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:12:02,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070967612] [2022-04-27 15:12:02,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070967612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:12:02,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:12:02,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:12:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517578288] [2022-04-27 15:12:02,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:12:02,277 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:12:02,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:12:02,277 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:12:02,291 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:12:02,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:12:02,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:12:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:12:02,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:12:02,292 INFO L87 Difference]: Start difference. First operand 16137 states and 20231 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:14:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:14:38,580 INFO L93 Difference]: Finished difference Result 46861 states and 57609 transitions. [2022-04-27 15:14:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:14:38,581 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:14:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:14:38,581 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:14:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-27 15:14:38,582 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:14:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-27 15:14:38,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-27 15:14:38,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:15:08,138 INFO L225 Difference]: With dead ends: 46861 [2022-04-27 15:15:08,139 INFO L226 Difference]: Without dead ends: 31243 [2022-04-27 15:15:08,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:15:08,152 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:15:08,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 93 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:15:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2022-04-27 15:15:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31241. [2022-04-27 15:15:08,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:15:08,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:15:08,607 INFO L74 IsIncluded]: Start isIncluded. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:15:08,635 INFO L87 Difference]: Start difference. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call 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:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:15:35,968 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-27 15:15:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-27 15:15:35,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:15:35,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:15:36,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 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 31243 states. [2022-04-27 15:15:36,041 INFO L87 Difference]: Start difference. First operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 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 31243 states. [2022-04-27 15:16:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:16:13,898 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-27 15:16:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-27 15:16:13,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:16:13,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:16:13,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:16:13,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:16:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call 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:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 37383 transitions. [2022-04-27 15:16:43,250 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 37383 transitions. Word has length 31 [2022-04-27 15:16:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:16:43,251 INFO L495 AbstractCegarLoop]: Abstraction has 31241 states and 37383 transitions. [2022-04-27 15:16:43,251 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:16:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 37383 transitions. [2022-04-27 15:16:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:16:43,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:16:43,262 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:16:43,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:16:43,262 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:16:43,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:16:43,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1627320854, now seen corresponding path program 1 times [2022-04-27 15:16:43,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:16:43,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615471665] [2022-04-27 15:16:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:16:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:16:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:16:43,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:16:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:16:43,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {560620#(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); {560614#true} is VALID [2022-04-27 15:16:43,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {560614#true} assume true; {560614#true} is VALID [2022-04-27 15:16:43,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {560614#true} {560614#true} #217#return; {560614#true} is VALID [2022-04-27 15:16:43,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {560614#true} call ULTIMATE.init(); {560620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:16:43,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {560620#(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); {560614#true} is VALID [2022-04-27 15:16:43,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {560614#true} assume true; {560614#true} is VALID [2022-04-27 15:16:43,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {560614#true} {560614#true} #217#return; {560614#true} is VALID [2022-04-27 15:16:43,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {560614#true} call #t~ret16 := main(); {560614#true} is VALID [2022-04-27 15:16:43,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {560614#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;havoc ~cond~0; {560614#true} is VALID [2022-04-27 15:16:43,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {560614#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {560614#true} is VALID [2022-04-27 15:16:43,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {560614#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; {560614#true} is VALID [2022-04-27 15:16:43,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {560614#true} assume !(0 != ~p1~0); {560614#true} is VALID [2022-04-27 15:16:43,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {560614#true} assume !(0 != ~p2~0); {560614#true} is VALID [2022-04-27 15:16:43,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {560614#true} assume !(0 != ~p3~0); {560614#true} is VALID [2022-04-27 15:16:43,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {560614#true} assume !(0 != ~p4~0); {560614#true} is VALID [2022-04-27 15:16:43,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {560614#true} assume !(0 != ~p5~0); {560614#true} is VALID [2022-04-27 15:16:43,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {560614#true} assume !(0 != ~p6~0); {560614#true} is VALID [2022-04-27 15:16:43,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {560614#true} assume !(0 != ~p7~0); {560614#true} is VALID [2022-04-27 15:16:43,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {560614#true} assume !(0 != ~p8~0); {560614#true} is VALID [2022-04-27 15:16:43,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {560614#true} assume !(0 != ~p9~0); {560614#true} is VALID [2022-04-27 15:16:43,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {560614#true} assume 0 != ~p10~0;~lk10~0 := 1; {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {560619#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {560619#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {560619#(= main_~lk10~0 1)} assume 0 != ~p10~0; {560619#(= main_~lk10~0 1)} is VALID [2022-04-27 15:16:43,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {560619#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {560615#false} is VALID [2022-04-27 15:16:43,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {560615#false} assume !false; {560615#false} is VALID [2022-04-27 15:16:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:16:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:16:43,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615471665] [2022-04-27 15:16:43,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615471665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:16:43,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:16:43,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:16:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346026150] [2022-04-27 15:16:43,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:16:43,307 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:16:43,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:16:43,307 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:16:43,324 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:16:43,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:16:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:16:43,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:16:43,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:16:43,325 INFO L87 Difference]: Start difference. First operand 31241 states and 37383 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:17:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:17:34,672 INFO L93 Difference]: Finished difference Result 33293 states and 40457 transitions. [2022-04-27 15:17:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:17:34,672 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:17:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:17:34,673 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:17:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-04-27 15:17:34,673 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:17:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-04-27 15:17:34,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 104 transitions. [2022-04-27 15:17:34,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:18:11,671 INFO L225 Difference]: With dead ends: 33293 [2022-04-27 15:18:11,672 INFO L226 Difference]: Without dead ends: 33291 [2022-04-27 15:18:11,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:18:11,676 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:18:11,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 108 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:18:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33291 states. [2022-04-27 15:18:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33291 to 31241. [2022-04-27 15:18:12,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:18:12,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33291 states. Second operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call 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:12,151 INFO L74 IsIncluded]: Start isIncluded. First operand 33291 states. Second operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call 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:12,185 INFO L87 Difference]: Start difference. First operand 33291 states. Second operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call 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:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:18:52,461 INFO L93 Difference]: Finished difference Result 33291 states and 39944 transitions. [2022-04-27 15:18:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 33291 states and 39944 transitions. [2022-04-27 15:18:52,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:18:52,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:18:52,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 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 33291 states. [2022-04-27 15:18:52,561 INFO L87 Difference]: Start difference. First operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 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 33291 states. [2022-04-27 15:19:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:19:39,756 INFO L93 Difference]: Finished difference Result 33291 states and 39944 transitions. [2022-04-27 15:19:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33291 states and 39944 transitions. [2022-04-27 15:19:39,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:19:39,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:19:39,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:19:39,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:19:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call 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:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 36871 transitions. [2022-04-27 15:20:11,497 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 36871 transitions. Word has length 31 [2022-04-27 15:20:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:20:11,497 INFO L495 AbstractCegarLoop]: Abstraction has 31241 states and 36871 transitions. [2022-04-27 15:20:11,497 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:20:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 36871 transitions. [2022-04-27 15:20:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:20:11,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:20:11,510 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:20:11,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 15:20:11,510 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:20:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:20:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash -186986472, now seen corresponding path program 1 times [2022-04-27 15:20:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:20:11,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503173387] [2022-04-27 15:20:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:20:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:20:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:20:11,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:20:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:20:11,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {694322#(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); {694316#true} is VALID [2022-04-27 15:20:11,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {694316#true} assume true; {694316#true} is VALID [2022-04-27 15:20:11,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {694316#true} {694316#true} #217#return; {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {694316#true} call ULTIMATE.init(); {694322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {694322#(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); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {694316#true} assume true; {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {694316#true} {694316#true} #217#return; {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {694316#true} call #t~ret16 := main(); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {694316#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;havoc ~cond~0; {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {694316#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {694316#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; {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {694316#true} assume !(0 != ~p1~0); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {694316#true} assume !(0 != ~p2~0); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {694316#true} assume !(0 != ~p3~0); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {694316#true} assume !(0 != ~p4~0); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {694316#true} assume !(0 != ~p5~0); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {694316#true} assume !(0 != ~p6~0); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {694316#true} assume !(0 != ~p7~0); {694316#true} is VALID [2022-04-27 15:20:11,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {694316#true} assume !(0 != ~p8~0); {694316#true} is VALID [2022-04-27 15:20:11,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {694316#true} assume !(0 != ~p9~0); {694316#true} is VALID [2022-04-27 15:20:11,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {694316#true} assume !(0 != ~p10~0); {694316#true} is VALID [2022-04-27 15:20:11,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {694316#true} assume 0 != ~p11~0;~lk11~0 := 1; {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p1~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p2~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p3~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p4~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p5~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p6~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p7~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p8~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p9~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {694321#(= main_~lk11~0 1)} assume !(0 != ~p10~0); {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {694321#(= main_~lk11~0 1)} assume 0 != ~p11~0; {694321#(= main_~lk11~0 1)} is VALID [2022-04-27 15:20:11,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {694321#(= main_~lk11~0 1)} assume 1 != ~lk11~0; {694317#false} is VALID [2022-04-27 15:20:11,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {694317#false} assume !false; {694317#false} is VALID [2022-04-27 15:20:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:20:11,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:20:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503173387] [2022-04-27 15:20:11,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503173387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:20:11,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:20:11,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:20:11,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630472190] [2022-04-27 15:20:11,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:20:11,542 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:20:11,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:20:11,542 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:20:11,558 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:20:11,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:20:11,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:20:11,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:20:11,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:20:11,559 INFO L87 Difference]: Start difference. First operand 31241 states and 36871 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)