/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:17:29,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:17:29,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:17:29,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:17:29,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:17:29,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:17:29,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:17:29,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:17:29,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:17:30,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:17:30,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:17:30,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:17:30,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:17:30,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:17:30,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:17:30,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:17:30,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:17:30,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:17:30,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:17:30,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:17:30,015 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:17:30,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:17:30,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:17:30,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:17:30,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:17:30,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:17:30,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:17:30,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:17:30,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:17:30,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:17:30,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:17:30,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:17:30,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:17:30,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:17:30,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:17:30,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:17:30,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:17:30,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:17:30,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:17:30,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:17:30,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:17:30,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:17:30,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:17:30,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:17:30,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:17:30,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:17:30,041 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:17:30,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:17:30,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:17:30,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:17:30,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:17:30,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:17:30,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:17:30,042 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:17:30,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:17:30,042 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:17:30,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:17:30,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:17:30,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:17:30,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:17:30,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:17:30,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:30,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:17:30,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:17:30,043 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:17:30,043 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:17:30,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:17:30,043 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:17:30,043 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:17:30,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:17:30,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:17:30,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:17:30,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:17:30,262 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:17:30,263 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-08 08:17:30,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa10304f/fd8227849f5b4ebdb5bc312735c594c5/FLAG24c949627 [2022-04-08 08:17:30,729 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:17:30,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2022-04-08 08:17:30,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa10304f/fd8227849f5b4ebdb5bc312735c594c5/FLAG24c949627 [2022-04-08 08:17:31,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa10304f/fd8227849f5b4ebdb5bc312735c594c5 [2022-04-08 08:17:31,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:17:31,095 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:17:31,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:31,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:17:31,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:17:31,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42cc2704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31, skipping insertion in model container [2022-04-08 08:17:31,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:17:31,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:17:31,279 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-08 08:17:31,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:31,296 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:17:31,312 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-08 08:17:31,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:31,321 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:17:31,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31 WrapperNode [2022-04-08 08:17:31,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:31,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:17:31,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:17:31,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:17:31,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:17:31,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:17:31,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:17:31,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:17:31,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (1/1) ... [2022-04-08 08:17:31,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:31,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:31,408 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-08 08:17:31,426 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-08 08:17:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:17:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:17:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:17:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:17:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:17:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:17:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:17:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:17:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:17:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:17:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:17:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:17:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:17:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:17:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:17:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:17:31,514 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:17:31,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:17:31,704 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:17:31,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:17:31,709 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:17:31,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:31 BoogieIcfgContainer [2022-04-08 08:17:31,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:17:31,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:17:31,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:17:31,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:17:31,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:17:31" (1/3) ... [2022-04-08 08:17:31,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a397f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:31, skipping insertion in model container [2022-04-08 08:17:31,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:31" (2/3) ... [2022-04-08 08:17:31,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a397f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:31, skipping insertion in model container [2022-04-08 08:17:31,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:31" (3/3) ... [2022-04-08 08:17:31,717 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-04-08 08:17:31,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:17:31,720 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:17:31,756 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:17:31,760 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:17:31,760 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:17:31,773 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-08 08:17:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:17:31,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:31,779 INFO L499 BasicCegarLoop]: 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-08 08:17:31,779 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 1 times [2022-04-08 08:17:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529283473] [2022-04-08 08:17:31,795 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:31,795 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 2 times [2022-04-08 08:17:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:31,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493013759] [2022-04-08 08:17:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:31,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:31,962 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-08 08:17:31,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-08 08:17:31,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-08 08:17:31,964 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-08 08:17:31,964 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-08 08:17:31,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-08 08:17:31,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-08 08:17:31,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret16 := main(); {51#true} is VALID [2022-04-08 08:17:31,965 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-08 08:17:31,965 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-08 08:17:31,965 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-08 08:17:31,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume 0 != ~p1~0;~lk1~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:31,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:31,967 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-08 08:17:31,967 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-08 08:17:31,968 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-08 08:17:31,968 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-08 08:17:31,969 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-08 08:17:31,969 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-08 08:17:31,970 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-08 08:17:31,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:31,970 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-08 08:17:31,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p1~0; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:31,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {56#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {52#false} is VALID [2022-04-08 08:17:31,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-08 08:17:31,972 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-08 08:17:31,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:31,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493013759] [2022-04-08 08:17:31,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493013759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:31,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:31,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:31,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:31,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529283473] [2022-04-08 08:17:31,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529283473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:31,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:31,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:31,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712176334] [2022-04-08 08:17:31,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:31,979 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-08 08:17:31,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:31,983 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-08 08:17:32,019 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-08 08:17:32,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:32,045 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-08 08:17:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:32,343 INFO L93 Difference]: Finished difference Result 94 states and 163 transitions. [2022-04-08 08:17:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:32,344 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-08 08:17:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:32,345 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-08 08:17:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 08:17:32,353 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-08 08:17:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 08:17:32,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 08:17:32,481 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-08 08:17:32,495 INFO L225 Difference]: With dead ends: 94 [2022-04-08 08:17:32,495 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 08:17:32,497 INFO L912 BasicCegarLoop]: 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-08 08:17:32,499 INFO L913 BasicCegarLoop]: 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-08 08:17:32,500 INFO L914 BasicCegarLoop]: 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-08 08:17:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 08:17:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-04-08 08:17:32,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:32,526 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-08 08:17:32,526 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-08 08:17:32,527 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-08 08:17:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:32,534 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-08 08:17:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-08 08:17:32,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:32,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:32,535 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-08 08:17:32,536 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-08 08:17:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:32,543 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-08 08:17:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-08 08:17:32,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:32,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:32,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:32,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:32,544 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-08 08:17:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-04-08 08:17:32,548 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2022-04-08 08:17:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:32,548 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-04-08 08:17:32,549 INFO L479 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-08 08:17:32,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 98 transitions. [2022-04-08 08:17:32,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:32,626 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-04-08 08:17:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:17:32,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:32,628 INFO L499 BasicCegarLoop]: 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-08 08:17:32,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:17:32,628 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 1 times [2022-04-08 08:17:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:32,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1934158834] [2022-04-08 08:17:32,630 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 2 times [2022-04-08 08:17:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:32,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434793490] [2022-04-08 08:17:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:32,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {519#true} is VALID [2022-04-08 08:17:32,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-08 08:17:32,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-08 08:17:32,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:32,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {519#true} is VALID [2022-04-08 08:17:32,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-08 08:17:32,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-08 08:17:32,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret16 := main(); {519#true} is VALID [2022-04-08 08:17:32,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#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; {519#true} is VALID [2022-04-08 08:17:32,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {519#true} is VALID [2022-04-08 08:17:32,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#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; {519#true} is VALID [2022-04-08 08:17:32,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume !(0 != ~p1~0); {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p2~0); {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p10~0); {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:32,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p1~0; {520#false} is VALID [2022-04-08 08:17:32,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {520#false} assume 1 != ~lk1~0; {520#false} is VALID [2022-04-08 08:17:32,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-04-08 08:17:32,743 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-08 08:17:32,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:32,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434793490] [2022-04-08 08:17:32,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434793490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:32,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:32,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:32,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:32,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1934158834] [2022-04-08 08:17:32,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1934158834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:32,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:32,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737454808] [2022-04-08 08:17:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:32,746 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-08 08:17:32,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:32,746 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-08 08:17:32,761 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-08 08:17:32,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:32,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:32,762 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-08 08:17:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:32,954 INFO L93 Difference]: Finished difference Result 128 states and 233 transitions. [2022-04-08 08:17:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:32,954 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-08 08:17:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:32,954 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-08 08:17:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-08 08:17:32,957 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-08 08:17:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-08 08:17:32,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-08 08:17:33,109 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-08 08:17:33,124 INFO L225 Difference]: With dead ends: 128 [2022-04-08 08:17:33,124 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 08:17:33,125 INFO L912 BasicCegarLoop]: 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-08 08:17:33,125 INFO L913 BasicCegarLoop]: 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-08 08:17:33,126 INFO L914 BasicCegarLoop]: 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-08 08:17:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 08:17:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-08 08:17:33,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:33,135 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-08 08:17:33,135 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-08 08:17:33,135 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-08 08:17:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:33,138 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-08 08:17:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-08 08:17:33,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:33,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:33,139 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-08 08:17:33,139 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-08 08:17:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:33,141 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-08 08:17:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-08 08:17:33,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:33,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:33,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:33,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:33,142 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-08 08:17:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2022-04-08 08:17:33,144 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2022-04-08 08:17:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:33,145 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2022-04-08 08:17:33,145 INFO L479 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-08 08:17:33,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 138 transitions. [2022-04-08 08:17:33,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2022-04-08 08:17:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:17:33,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:33,256 INFO L499 BasicCegarLoop]: 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-08 08:17:33,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:17:33,256 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:33,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 1 times [2022-04-08 08:17:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383232222] [2022-04-08 08:17:33,258 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 2 times [2022-04-08 08:17:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:33,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206160634] [2022-04-08 08:17:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:33,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:33,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1099#true} is VALID [2022-04-08 08:17:33,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-08 08:17:33,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-08 08:17:33,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:33,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1099#true} is VALID [2022-04-08 08:17:33,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-08 08:17:33,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-08 08:17:33,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret16 := main(); {1099#true} is VALID [2022-04-08 08:17:33,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#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; {1099#true} is VALID [2022-04-08 08:17:33,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1099#true} is VALID [2022-04-08 08:17:33,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#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; {1099#true} is VALID [2022-04-08 08:17:33,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume 0 != ~p1~0;~lk1~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:33,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1100#false} is VALID [2022-04-08 08:17:33,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {1100#false} assume 0 != ~p2~0; {1100#false} is VALID [2022-04-08 08:17:33,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#false} assume 1 != ~lk2~0; {1100#false} is VALID [2022-04-08 08:17:33,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-08 08:17:33,315 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-08 08:17:33,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:33,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206160634] [2022-04-08 08:17:33,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206160634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:33,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:33,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:33,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:33,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383232222] [2022-04-08 08:17:33,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383232222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:33,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:33,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:33,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041415174] [2022-04-08 08:17:33,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:33,317 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-08 08:17:33,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:33,317 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-08 08:17:33,330 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-08 08:17:33,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:33,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:33,331 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-08 08:17:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:33,504 INFO L93 Difference]: Finished difference Result 118 states and 208 transitions. [2022-04-08 08:17:33,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:33,504 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-08 08:17:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:33,504 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-08 08:17:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-08 08:17:33,507 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-08 08:17:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-08 08:17:33,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-08 08:17:33,666 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-08 08:17:33,668 INFO L225 Difference]: With dead ends: 118 [2022-04-08 08:17:33,668 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 08:17:33,668 INFO L912 BasicCegarLoop]: 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-08 08:17:33,669 INFO L913 BasicCegarLoop]: 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-08 08:17:33,669 INFO L914 BasicCegarLoop]: 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-08 08:17:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 08:17:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-04-08 08:17:33,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:33,676 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-08 08:17:33,677 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-08 08:17:33,677 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-08 08:17:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:33,679 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-08 08:17:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-08 08:17:33,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:33,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:33,680 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-08 08:17:33,680 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-08 08:17:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:33,682 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-08 08:17:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-08 08:17:33,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:33,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:33,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:33,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:33,683 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-08 08:17:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2022-04-08 08:17:33,685 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2022-04-08 08:17:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:33,685 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2022-04-08 08:17:33,685 INFO L479 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-08 08:17:33,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 140 transitions. [2022-04-08 08:17:33,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2022-04-08 08:17:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:17:33,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:33,799 INFO L499 BasicCegarLoop]: 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-08 08:17:33,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:17:33,799 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 1 times [2022-04-08 08:17:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192755152] [2022-04-08 08:17:33,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 2 times [2022-04-08 08:17:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:33,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459291369] [2022-04-08 08:17:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:33,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1671#true} is VALID [2022-04-08 08:17:33,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-08 08:17:33,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-08 08:17:33,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:33,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1671#true} is VALID [2022-04-08 08:17:33,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-08 08:17:33,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-08 08:17:33,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret16 := main(); {1671#true} is VALID [2022-04-08 08:17:33,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#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; {1671#true} is VALID [2022-04-08 08:17:33,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1671#true} is VALID [2022-04-08 08:17:33,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#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; {1671#true} is VALID [2022-04-08 08:17:33,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#true} assume !(0 != ~p1~0); {1671#true} is VALID [2022-04-08 08:17:33,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {1671#true} assume !(0 != ~p2~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:33,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p2~0; {1672#false} is VALID [2022-04-08 08:17:33,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {1672#false} assume 1 != ~lk2~0; {1672#false} is VALID [2022-04-08 08:17:33,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-08 08:17:33,849 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-08 08:17:33,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:33,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459291369] [2022-04-08 08:17:33,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459291369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:33,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:33,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:33,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:33,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192755152] [2022-04-08 08:17:33,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192755152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:33,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:33,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:33,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354179902] [2022-04-08 08:17:33,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:33,850 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-08 08:17:33,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:33,851 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-08 08:17:33,863 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-08 08:17:33,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:33,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:33,864 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-08 08:17:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,042 INFO L93 Difference]: Finished difference Result 220 states and 396 transitions. [2022-04-08 08:17:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:34,043 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-08 08:17:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:34,043 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-08 08:17:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-08 08:17:34,045 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-08 08:17:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-08 08:17:34,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-08 08:17:34,189 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-08 08:17:34,191 INFO L225 Difference]: With dead ends: 220 [2022-04-08 08:17:34,191 INFO L226 Difference]: Without dead ends: 149 [2022-04-08 08:17:34,192 INFO L912 BasicCegarLoop]: 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-08 08:17:34,193 INFO L913 BasicCegarLoop]: 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-08 08:17:34,193 INFO L914 BasicCegarLoop]: 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-08 08:17:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-08 08:17:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-04-08 08:17:34,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:34,203 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-08 08:17:34,203 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-08 08:17:34,204 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-08 08:17:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,207 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-08 08:17:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-08 08:17:34,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:34,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:34,208 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-08 08:17:34,208 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-08 08:17:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,212 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-08 08:17:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-08 08:17:34,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:34,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:34,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:34,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:34,212 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-08 08:17:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 261 transitions. [2022-04-08 08:17:34,216 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 261 transitions. Word has length 23 [2022-04-08 08:17:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:34,216 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 261 transitions. [2022-04-08 08:17:34,216 INFO L479 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-08 08:17:34,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 261 transitions. [2022-04-08 08:17:34,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 261 transitions. [2022-04-08 08:17:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:17:34,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:34,425 INFO L499 BasicCegarLoop]: 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-08 08:17:34,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:17:34,425 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 1 times [2022-04-08 08:17:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:34,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [77157691] [2022-04-08 08:17:34,426 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 2 times [2022-04-08 08:17:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:34,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191232139] [2022-04-08 08:17:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:34,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:34,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2715#true} is VALID [2022-04-08 08:17:34,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-08 08:17:34,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-08 08:17:34,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {2715#true} call ULTIMATE.init(); {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:34,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2715#true} is VALID [2022-04-08 08:17:34,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-08 08:17:34,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-08 08:17:34,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {2715#true} call #t~ret16 := main(); {2715#true} is VALID [2022-04-08 08:17:34,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {2715#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; {2715#true} is VALID [2022-04-08 08:17:34,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {2715#true} is VALID [2022-04-08 08:17:34,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {2715#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; {2715#true} is VALID [2022-04-08 08:17:34,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !(0 != ~p1~0); {2715#true} is VALID [2022-04-08 08:17:34,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {2715#true} assume 0 != ~p2~0;~lk2~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:34,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {2720#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2716#false} is VALID [2022-04-08 08:17:34,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-04-08 08:17:34,493 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-08 08:17:34,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:34,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191232139] [2022-04-08 08:17:34,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191232139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:34,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:34,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:34,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:34,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [77157691] [2022-04-08 08:17:34,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [77157691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:34,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:34,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595973261] [2022-04-08 08:17:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:34,495 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-08 08:17:34,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:34,495 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-08 08:17:34,509 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-08 08:17:34,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:34,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:34,510 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-08 08:17:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,692 INFO L93 Difference]: Finished difference Result 191 states and 339 transitions. [2022-04-08 08:17:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:34,692 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-08 08:17:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:34,692 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-08 08:17:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 08:17:34,693 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-08 08:17:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 08:17:34,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-08 08:17:34,793 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-08 08:17:34,796 INFO L225 Difference]: With dead ends: 191 [2022-04-08 08:17:34,796 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 08:17:34,796 INFO L912 BasicCegarLoop]: 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-08 08:17:34,797 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:34,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 08:17:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2022-04-08 08:17:34,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:34,807 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-08 08:17:34,808 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-08 08:17:34,808 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-08 08:17:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,812 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-08 08:17:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-08 08:17:34,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:34,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:34,813 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-08 08:17:34,813 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-08 08:17:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,817 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-08 08:17:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-08 08:17:34,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:34,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:34,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:34,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:34,818 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-08 08:17:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2022-04-08 08:17:34,821 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2022-04-08 08:17:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:34,821 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2022-04-08 08:17:34,821 INFO L479 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-08 08:17:34,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 259 transitions. [2022-04-08 08:17:35,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-04-08 08:17:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:35,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:35,034 INFO L499 BasicCegarLoop]: 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-08 08:17:35,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:17:35,034 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 1 times [2022-04-08 08:17:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406731241] [2022-04-08 08:17:35,035 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 2 times [2022-04-08 08:17:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:35,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831604242] [2022-04-08 08:17:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:35,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3781#true} is VALID [2022-04-08 08:17:35,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-08 08:17:35,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-08 08:17:35,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {3781#true} call ULTIMATE.init(); {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:35,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3781#true} is VALID [2022-04-08 08:17:35,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-08 08:17:35,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-08 08:17:35,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {3781#true} call #t~ret16 := main(); {3781#true} is VALID [2022-04-08 08:17:35,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {3781#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; {3781#true} is VALID [2022-04-08 08:17:35,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {3781#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {3781#true} is VALID [2022-04-08 08:17:35,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {3781#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; {3781#true} is VALID [2022-04-08 08:17:35,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {3781#true} assume !(0 != ~p1~0); {3781#true} is VALID [2022-04-08 08:17:35,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {3781#true} assume !(0 != ~p2~0); {3781#true} is VALID [2022-04-08 08:17:35,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {3781#true} assume 0 != ~p3~0;~lk3~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:35,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {3786#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3782#false} is VALID [2022-04-08 08:17:35,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {3782#false} assume !false; {3782#false} is VALID [2022-04-08 08:17:35,076 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-08 08:17:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:35,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831604242] [2022-04-08 08:17:35,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831604242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:35,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1406731241] [2022-04-08 08:17:35,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1406731241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296405709] [2022-04-08 08:17:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:35,077 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-08 08:17:35,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:35,078 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-08 08:17:35,091 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-08 08:17:35,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:35,092 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-08 08:17:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,269 INFO L93 Difference]: Finished difference Result 275 states and 491 transitions. [2022-04-08 08:17:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:35,269 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-08 08:17:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:35,269 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-08 08:17:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 08:17:35,271 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-08 08:17:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 08:17:35,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-08 08:17:35,368 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-08 08:17:35,372 INFO L225 Difference]: With dead ends: 275 [2022-04-08 08:17:35,372 INFO L226 Difference]: Without dead ends: 273 [2022-04-08 08:17:35,372 INFO L912 BasicCegarLoop]: 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-08 08:17:35,373 INFO L913 BasicCegarLoop]: 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-08 08:17:35,373 INFO L914 BasicCegarLoop]: 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-08 08:17:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-08 08:17:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 199. [2022-04-08 08:17:35,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:35,386 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-08 08:17:35,387 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-08 08:17:35,387 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-08 08:17:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,393 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-08 08:17:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-08 08:17:35,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:35,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:35,394 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-08 08:17:35,395 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-08 08:17:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,401 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-08 08:17:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-08 08:17:35,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:35,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:35,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:35,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:35,402 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-08 08:17:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 349 transitions. [2022-04-08 08:17:35,406 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 349 transitions. Word has length 24 [2022-04-08 08:17:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:35,406 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 349 transitions. [2022-04-08 08:17:35,407 INFO L479 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-08 08:17:35,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 349 transitions. [2022-04-08 08:17:35,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 349 transitions. [2022-04-08 08:17:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:35,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:35,682 INFO L499 BasicCegarLoop]: 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-08 08:17:35,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:17:35,683 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 1 times [2022-04-08 08:17:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156724061] [2022-04-08 08:17:35,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:35,684 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 2 times [2022-04-08 08:17:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:35,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848896913] [2022-04-08 08:17:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5287#true} is VALID [2022-04-08 08:17:35,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-08 08:17:35,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-08 08:17:35,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {5287#true} call ULTIMATE.init(); {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:35,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5287#true} is VALID [2022-04-08 08:17:35,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-08 08:17:35,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-08 08:17:35,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {5287#true} call #t~ret16 := main(); {5287#true} is VALID [2022-04-08 08:17:35,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {5287#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; {5287#true} is VALID [2022-04-08 08:17:35,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {5287#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {5287#true} is VALID [2022-04-08 08:17:35,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {5287#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; {5287#true} is VALID [2022-04-08 08:17:35,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {5287#true} assume !(0 != ~p1~0); {5287#true} is VALID [2022-04-08 08:17:35,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {5287#true} assume !(0 != ~p2~0); {5287#true} is VALID [2022-04-08 08:17:35,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {5287#true} assume !(0 != ~p3~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:35,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p3~0; {5288#false} is VALID [2022-04-08 08:17:35,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {5288#false} assume 1 != ~lk3~0; {5288#false} is VALID [2022-04-08 08:17:35,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2022-04-08 08:17:35,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-08 08:17:35,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:35,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848896913] [2022-04-08 08:17:35,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848896913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:35,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156724061] [2022-04-08 08:17:35,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156724061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462502914] [2022-04-08 08:17:35,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:35,724 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-08 08:17:35,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:35,724 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-08 08:17:35,736 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-08 08:17:35,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:35,737 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-08 08:17:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,891 INFO L93 Difference]: Finished difference Result 471 states and 835 transitions. [2022-04-08 08:17:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:35,891 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-08 08:17:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:35,892 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-08 08:17:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-08 08:17:35,894 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-08 08:17:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-08 08:17:35,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-08 08:17:36,008 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-08 08:17:36,012 INFO L225 Difference]: With dead ends: 471 [2022-04-08 08:17:36,012 INFO L226 Difference]: Without dead ends: 281 [2022-04-08 08:17:36,013 INFO L912 BasicCegarLoop]: 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-08 08:17:36,014 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:36,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-08 08:17:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2022-04-08 08:17:36,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:36,029 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-08 08:17:36,030 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-08 08:17:36,030 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-08 08:17:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,035 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-08 08:17:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-08 08:17:36,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,036 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-08 08:17:36,037 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-08 08:17:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,041 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-08 08:17:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-08 08:17:36,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:36,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:36,042 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-08 08:17:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 487 transitions. [2022-04-08 08:17:36,047 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 487 transitions. Word has length 24 [2022-04-08 08:17:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:36,048 INFO L478 AbstractCegarLoop]: Abstraction has 279 states and 487 transitions. [2022-04-08 08:17:36,048 INFO L479 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-08 08:17:36,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 279 states and 487 transitions. [2022-04-08 08:17:36,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 487 transitions. [2022-04-08 08:17:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:36,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:36,532 INFO L499 BasicCegarLoop]: 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-08 08:17:36,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:17:36,532 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:36,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 1 times [2022-04-08 08:17:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950033257] [2022-04-08 08:17:36,533 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 2 times [2022-04-08 08:17:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:36,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969580590] [2022-04-08 08:17:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:36,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7361#true} is VALID [2022-04-08 08:17:36,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-08 08:17:36,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-08 08:17:36,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:36,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7361#true} is VALID [2022-04-08 08:17:36,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-08 08:17:36,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-08 08:17:36,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret16 := main(); {7361#true} is VALID [2022-04-08 08:17:36,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#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; {7361#true} is VALID [2022-04-08 08:17:36,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {7361#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {7361#true} is VALID [2022-04-08 08:17:36,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#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; {7361#true} is VALID [2022-04-08 08:17:36,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 != ~p1~0); {7361#true} is VALID [2022-04-08 08:17:36,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume !(0 != ~p2~0); {7361#true} is VALID [2022-04-08 08:17:36,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {7361#true} assume 0 != ~p3~0;~lk3~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:36,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7362#false} is VALID [2022-04-08 08:17:36,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {7362#false} assume 0 != ~p4~0; {7362#false} is VALID [2022-04-08 08:17:36,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {7362#false} assume 1 != ~lk4~0; {7362#false} is VALID [2022-04-08 08:17:36,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-08 08:17:36,631 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-08 08:17:36,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:36,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969580590] [2022-04-08 08:17:36,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969580590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:36,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:36,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:36,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:36,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950033257] [2022-04-08 08:17:36,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950033257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:36,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:36,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:36,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967841591] [2022-04-08 08:17:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:36,632 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-08 08:17:36,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:36,632 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-08 08:17:36,660 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-08 08:17:36,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:36,661 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-08 08:17:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,841 INFO L93 Difference]: Finished difference Result 421 states and 733 transitions. [2022-04-08 08:17:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:36,841 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-08 08:17:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:36,841 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-08 08:17:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 08:17:36,842 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-08 08:17:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 08:17:36,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-08 08:17:36,957 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-08 08:17:36,961 INFO L225 Difference]: With dead ends: 421 [2022-04-08 08:17:36,962 INFO L226 Difference]: Without dead ends: 287 [2022-04-08 08:17:36,962 INFO L912 BasicCegarLoop]: 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-08 08:17:36,963 INFO L913 BasicCegarLoop]: 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-08 08:17:36,963 INFO L914 BasicCegarLoop]: 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-08 08:17:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-08 08:17:36,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-04-08 08:17:36,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:36,977 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-08 08:17:36,978 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-08 08:17:36,978 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-08 08:17:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,983 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-08 08:17:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-08 08:17:36,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,984 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-08 08:17:36,984 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-08 08:17:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,989 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-08 08:17:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-08 08:17:36,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:36,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:36,991 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-08 08:17:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 491 transitions. [2022-04-08 08:17:36,995 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 491 transitions. Word has length 25 [2022-04-08 08:17:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:36,996 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 491 transitions. [2022-04-08 08:17:36,996 INFO L479 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-08 08:17:36,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 491 transitions. [2022-04-08 08:17:37,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 491 transitions. [2022-04-08 08:17:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:37,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:37,383 INFO L499 BasicCegarLoop]: 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-08 08:17:37,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:17:37,384 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:37,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:37,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 1 times [2022-04-08 08:17:37,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208770129] [2022-04-08 08:17:37,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:37,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 2 times [2022-04-08 08:17:37,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:37,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508692479] [2022-04-08 08:17:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:37,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9359#true} is VALID [2022-04-08 08:17:37,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-08 08:17:37,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-08 08:17:37,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {9359#true} call ULTIMATE.init(); {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:37,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9359#true} is VALID [2022-04-08 08:17:37,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-08 08:17:37,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-08 08:17:37,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {9359#true} call #t~ret16 := main(); {9359#true} is VALID [2022-04-08 08:17:37,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {9359#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; {9359#true} is VALID [2022-04-08 08:17:37,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {9359#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {9359#true} is VALID [2022-04-08 08:17:37,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {9359#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; {9359#true} is VALID [2022-04-08 08:17:37,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {9359#true} assume !(0 != ~p1~0); {9359#true} is VALID [2022-04-08 08:17:37,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {9359#true} assume !(0 != ~p2~0); {9359#true} is VALID [2022-04-08 08:17:37,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {9359#true} assume !(0 != ~p3~0); {9359#true} is VALID [2022-04-08 08:17:37,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {9359#true} assume 0 != ~p4~0;~lk4~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p4~0; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:37,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {9364#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {9360#false} is VALID [2022-04-08 08:17:37,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {9360#false} assume !false; {9360#false} is VALID [2022-04-08 08:17:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:37,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:37,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508692479] [2022-04-08 08:17:37,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508692479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:37,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:37,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:37,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:37,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208770129] [2022-04-08 08:17:37,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208770129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:37,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:37,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:37,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553993793] [2022-04-08 08:17:37,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:37,425 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-08 08:17:37,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:37,425 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-08 08:17:37,438 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-08 08:17:37,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:37,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:37,439 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-08 08:17:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,596 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2022-04-08 08:17:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:37,596 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-08 08:17:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:37,596 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-08 08:17:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-08 08:17:37,597 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-08 08:17:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-08 08:17:37,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-08 08:17:37,674 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-08 08:17:37,686 INFO L225 Difference]: With dead ends: 525 [2022-04-08 08:17:37,686 INFO L226 Difference]: Without dead ends: 523 [2022-04-08 08:17:37,686 INFO L912 BasicCegarLoop]: 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-08 08:17:37,687 INFO L913 BasicCegarLoop]: 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-08 08:17:37,687 INFO L914 BasicCegarLoop]: 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-08 08:17:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-08 08:17:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 393. [2022-04-08 08:17:37,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:37,707 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-08 08:17:37,707 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-08 08:17:37,708 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-08 08:17:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,719 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-08 08:17:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-08 08:17:37,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:37,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:37,720 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-08 08:17:37,720 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-08 08:17:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,739 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-08 08:17:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-08 08:17:37,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:37,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:37,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:37,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:37,740 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-08 08:17:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 667 transitions. [2022-04-08 08:17:37,748 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 667 transitions. Word has length 25 [2022-04-08 08:17:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:37,749 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 667 transitions. [2022-04-08 08:17:37,749 INFO L479 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-08 08:17:37,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 667 transitions. [2022-04-08 08:17:38,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 667 edges. 667 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 667 transitions. [2022-04-08 08:17:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:38,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:38,288 INFO L499 BasicCegarLoop]: 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-08 08:17:38,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:17:38,288 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 1 times [2022-04-08 08:17:38,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:38,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [723818316] [2022-04-08 08:17:38,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:38,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 2 times [2022-04-08 08:17:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:38,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57315857] [2022-04-08 08:17:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:38,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:38,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:38,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12253#true} is VALID [2022-04-08 08:17:38,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-08 08:17:38,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-08 08:17:38,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {12253#true} call ULTIMATE.init(); {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:38,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12253#true} is VALID [2022-04-08 08:17:38,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-08 08:17:38,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-08 08:17:38,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#true} call #t~ret16 := main(); {12253#true} is VALID [2022-04-08 08:17:38,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#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; {12253#true} is VALID [2022-04-08 08:17:38,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {12253#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {12253#true} is VALID [2022-04-08 08:17:38,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#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; {12253#true} is VALID [2022-04-08 08:17:38,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#true} assume !(0 != ~p1~0); {12253#true} is VALID [2022-04-08 08:17:38,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#true} assume !(0 != ~p2~0); {12253#true} is VALID [2022-04-08 08:17:38,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {12253#true} assume !(0 != ~p3~0); {12253#true} is VALID [2022-04-08 08:17:38,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {12253#true} assume !(0 != ~p4~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p10~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p1~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p2~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p3~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:38,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p4~0; {12254#false} is VALID [2022-04-08 08:17:38,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {12254#false} assume 1 != ~lk4~0; {12254#false} is VALID [2022-04-08 08:17:38,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {12254#false} assume !false; {12254#false} is VALID [2022-04-08 08:17:38,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-08 08:17:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:38,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57315857] [2022-04-08 08:17:38,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57315857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:38,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:38,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:38,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:38,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [723818316] [2022-04-08 08:17:38,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [723818316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:38,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:38,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007277198] [2022-04-08 08:17:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:38,375 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-08 08:17:38,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:38,375 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-08 08:17:38,390 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-08 08:17:38,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:38,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:38,390 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-08 08:17:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,611 INFO L93 Difference]: Finished difference Result 925 states and 1581 transitions. [2022-04-08 08:17:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:38,612 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-08 08:17:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:38,613 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-08 08:17:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-08 08:17:38,614 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-08 08:17:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-08 08:17:38,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2022-04-08 08:17:38,769 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-08 08:17:38,781 INFO L225 Difference]: With dead ends: 925 [2022-04-08 08:17:38,781 INFO L226 Difference]: Without dead ends: 547 [2022-04-08 08:17:38,781 INFO L912 BasicCegarLoop]: 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-08 08:17:38,783 INFO L913 BasicCegarLoop]: 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-08 08:17:38,783 INFO L914 BasicCegarLoop]: 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-08 08:17:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-08 08:17:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-04-08 08:17:38,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:38,813 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-08 08:17:38,813 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-08 08:17:38,815 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-08 08:17:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,826 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-08 08:17:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-08 08:17:38,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,828 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-08 08:17:38,828 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-08 08:17:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,840 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-08 08:17:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-08 08:17:38,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:38,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:38,842 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-08 08:17:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 919 transitions. [2022-04-08 08:17:38,855 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 919 transitions. Word has length 25 [2022-04-08 08:17:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:38,855 INFO L478 AbstractCegarLoop]: Abstraction has 545 states and 919 transitions. [2022-04-08 08:17:38,855 INFO L479 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-08 08:17:38,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 545 states and 919 transitions. [2022-04-08 08:17:39,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 919 transitions. [2022-04-08 08:17:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:39,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:39,678 INFO L499 BasicCegarLoop]: 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-08 08:17:39,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:17:39,678 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 1 times [2022-04-08 08:17:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:39,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268483092] [2022-04-08 08:17:39,679 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 2 times [2022-04-08 08:17:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:39,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998871880] [2022-04-08 08:17:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:39,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:39,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {16299#true} is VALID [2022-04-08 08:17:39,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-08 08:17:39,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-08 08:17:39,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {16299#true} call ULTIMATE.init(); {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:39,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {16299#true} is VALID [2022-04-08 08:17:39,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-08 08:17:39,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-08 08:17:39,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {16299#true} call #t~ret16 := main(); {16299#true} is VALID [2022-04-08 08:17:39,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {16299#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; {16299#true} is VALID [2022-04-08 08:17:39,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {16299#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {16299#true} is VALID [2022-04-08 08:17:39,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {16299#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; {16299#true} is VALID [2022-04-08 08:17:39,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {16299#true} assume !(0 != ~p1~0); {16299#true} is VALID [2022-04-08 08:17:39,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {16299#true} assume !(0 != ~p2~0); {16299#true} is VALID [2022-04-08 08:17:39,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {16299#true} assume !(0 != ~p3~0); {16299#true} is VALID [2022-04-08 08:17:39,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {16299#true} assume 0 != ~p4~0;~lk4~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:39,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {16300#false} is VALID [2022-04-08 08:17:39,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {16300#false} assume 0 != ~p5~0; {16300#false} is VALID [2022-04-08 08:17:39,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {16300#false} assume 1 != ~lk5~0; {16300#false} is VALID [2022-04-08 08:17:39,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {16300#false} assume !false; {16300#false} is VALID [2022-04-08 08:17:39,739 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-08 08:17:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:39,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998871880] [2022-04-08 08:17:39,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998871880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:39,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:39,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:39,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:39,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268483092] [2022-04-08 08:17:39,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268483092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:39,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:39,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787869157] [2022-04-08 08:17:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:39,740 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-08 08:17:39,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:39,740 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-08 08:17:39,756 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-08 08:17:39,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:39,757 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-08 08:17:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:39,980 INFO L93 Difference]: Finished difference Result 817 states and 1373 transitions. [2022-04-08 08:17:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:39,981 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-08 08:17:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:39,981 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-08 08:17:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-08 08:17:39,983 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-08 08:17:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-08 08:17:39,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-08 08:17:40,103 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-08 08:17:40,116 INFO L225 Difference]: With dead ends: 817 [2022-04-08 08:17:40,116 INFO L226 Difference]: Without dead ends: 555 [2022-04-08 08:17:40,116 INFO L912 BasicCegarLoop]: 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-08 08:17:40,117 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:40,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 114 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-08 08:17:40,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2022-04-08 08:17:40,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:40,146 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-08 08:17:40,147 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-08 08:17:40,147 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-08 08:17:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,158 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-08 08:17:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-08 08:17:40,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:40,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:40,160 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-08 08:17:40,160 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-08 08:17:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,172 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-08 08:17:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-08 08:17:40,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:40,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:40,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:40,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:40,173 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-08 08:17:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 919 transitions. [2022-04-08 08:17:40,186 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 919 transitions. Word has length 26 [2022-04-08 08:17:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:40,186 INFO L478 AbstractCegarLoop]: Abstraction has 553 states and 919 transitions. [2022-04-08 08:17:40,186 INFO L479 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-08 08:17:40,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 919 transitions. [2022-04-08 08:17:40,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 919 transitions. [2022-04-08 08:17:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:40,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:40,982 INFO L499 BasicCegarLoop]: 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-08 08:17:40,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:17:40,982 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 1 times [2022-04-08 08:17:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:40,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [411919387] [2022-04-08 08:17:40,983 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 2 times [2022-04-08 08:17:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:40,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650112367] [2022-04-08 08:17:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:41,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:41,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20161#true} is VALID [2022-04-08 08:17:41,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-08 08:17:41,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-08 08:17:41,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {20161#true} call ULTIMATE.init(); {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:41,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20161#true} is VALID [2022-04-08 08:17:41,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-08 08:17:41,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-08 08:17:41,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {20161#true} call #t~ret16 := main(); {20161#true} is VALID [2022-04-08 08:17:41,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {20161#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; {20161#true} is VALID [2022-04-08 08:17:41,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {20161#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {20161#true} is VALID [2022-04-08 08:17:41,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {20161#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; {20161#true} is VALID [2022-04-08 08:17:41,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {20161#true} assume !(0 != ~p1~0); {20161#true} is VALID [2022-04-08 08:17:41,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {20161#true} assume !(0 != ~p2~0); {20161#true} is VALID [2022-04-08 08:17:41,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {20161#true} assume !(0 != ~p3~0); {20161#true} is VALID [2022-04-08 08:17:41,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {20161#true} assume !(0 != ~p4~0); {20161#true} is VALID [2022-04-08 08:17:41,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {20161#true} assume 0 != ~p5~0;~lk5~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p5~0; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:41,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {20166#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {20162#false} is VALID [2022-04-08 08:17:41,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {20162#false} assume !false; {20162#false} is VALID [2022-04-08 08:17:41,027 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-08 08:17:41,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:41,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650112367] [2022-04-08 08:17:41,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650112367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:41,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:41,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:41,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:41,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [411919387] [2022-04-08 08:17:41,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [411919387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:41,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:41,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:41,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760880249] [2022-04-08 08:17:41,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:41,028 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-08 08:17:41,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:41,029 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-08 08:17:41,046 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-08 08:17:41,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:41,047 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-08 08:17:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,289 INFO L93 Difference]: Finished difference Result 1005 states and 1697 transitions. [2022-04-08 08:17:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:41,289 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-08 08:17:41,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:41,290 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-08 08:17:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 08:17:41,291 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-08 08:17:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 08:17:41,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 08:17:41,394 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-08 08:17:41,431 INFO L225 Difference]: With dead ends: 1005 [2022-04-08 08:17:41,431 INFO L226 Difference]: Without dead ends: 1003 [2022-04-08 08:17:41,432 INFO L912 BasicCegarLoop]: 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-08 08:17:41,432 INFO L913 BasicCegarLoop]: 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-08 08:17:41,433 INFO L914 BasicCegarLoop]: 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-08 08:17:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-08 08:17:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 777. [2022-04-08 08:17:41,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:41,476 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-08 08:17:41,476 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-08 08:17:41,477 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-08 08:17:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,507 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-08 08:17:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-08 08:17:41,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:41,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:41,509 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-08 08:17:41,510 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-08 08:17:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,541 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-08 08:17:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-08 08:17:41,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:41,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:41,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:41,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:41,544 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-08 08:17:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1263 transitions. [2022-04-08 08:17:41,571 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1263 transitions. Word has length 26 [2022-04-08 08:17:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:41,571 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1263 transitions. [2022-04-08 08:17:41,571 INFO L479 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-08 08:17:41,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1263 transitions. [2022-04-08 08:17:42,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1263 transitions. [2022-04-08 08:17:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:42,538 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:42,538 INFO L499 BasicCegarLoop]: 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-08 08:17:42,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:17:42,538 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:42,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 1 times [2022-04-08 08:17:42,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:42,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [568074459] [2022-04-08 08:17:42,539 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 2 times [2022-04-08 08:17:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:42,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791626458] [2022-04-08 08:17:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:42,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {25743#true} is VALID [2022-04-08 08:17:42,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-08 08:17:42,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-08 08:17:42,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {25743#true} call ULTIMATE.init(); {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:42,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {25743#true} is VALID [2022-04-08 08:17:42,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-08 08:17:42,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-08 08:17:42,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {25743#true} call #t~ret16 := main(); {25743#true} is VALID [2022-04-08 08:17:42,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {25743#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; {25743#true} is VALID [2022-04-08 08:17:42,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {25743#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {25743#true} is VALID [2022-04-08 08:17:42,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {25743#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; {25743#true} is VALID [2022-04-08 08:17:42,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {25743#true} assume !(0 != ~p1~0); {25743#true} is VALID [2022-04-08 08:17:42,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {25743#true} assume !(0 != ~p2~0); {25743#true} is VALID [2022-04-08 08:17:42,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {25743#true} assume !(0 != ~p3~0); {25743#true} is VALID [2022-04-08 08:17:42,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {25743#true} assume !(0 != ~p4~0); {25743#true} is VALID [2022-04-08 08:17:42,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {25743#true} assume !(0 != ~p5~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p10~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p1~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p2~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p3~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p4~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:42,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p5~0; {25744#false} is VALID [2022-04-08 08:17:42,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {25744#false} assume 1 != ~lk5~0; {25744#false} is VALID [2022-04-08 08:17:42,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {25744#false} assume !false; {25744#false} is VALID [2022-04-08 08:17:42,598 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-08 08:17:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:42,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791626458] [2022-04-08 08:17:42,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791626458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:42,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:42,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:42,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:42,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [568074459] [2022-04-08 08:17:42,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [568074459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:42,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:42,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810307337] [2022-04-08 08:17:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:42,600 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-08 08:17:42,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:42,600 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-08 08:17:42,614 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-08 08:17:42,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:42,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:42,615 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-08 08:17:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:42,970 INFO L93 Difference]: Finished difference Result 1821 states and 2977 transitions. [2022-04-08 08:17:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:42,970 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-08 08:17:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:42,971 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-08 08:17:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-08 08:17:42,972 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-08 08:17:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-08 08:17:42,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 198 transitions. [2022-04-08 08:17:43,098 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-08 08:17:43,172 INFO L225 Difference]: With dead ends: 1821 [2022-04-08 08:17:43,172 INFO L226 Difference]: Without dead ends: 1067 [2022-04-08 08:17:43,173 INFO L912 BasicCegarLoop]: 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-08 08:17:43,175 INFO L913 BasicCegarLoop]: 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-08 08:17:43,175 INFO L914 BasicCegarLoop]: 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-08 08:17:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-04-08 08:17:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2022-04-08 08:17:43,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:43,236 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-08 08:17:43,237 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-08 08:17:43,238 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-08 08:17:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:43,272 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-08 08:17:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-08 08:17:43,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:43,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:43,274 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-08 08:17:43,275 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-08 08:17:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:43,308 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-08 08:17:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-08 08:17:43,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:43,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:43,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:43,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:43,310 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-08 08:17:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1719 transitions. [2022-04-08 08:17:43,354 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1719 transitions. Word has length 26 [2022-04-08 08:17:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:43,355 INFO L478 AbstractCegarLoop]: Abstraction has 1065 states and 1719 transitions. [2022-04-08 08:17:43,355 INFO L479 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-08 08:17:43,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1065 states and 1719 transitions. [2022-04-08 08:17:44,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1719 transitions. [2022-04-08 08:17:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:44,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:44,994 INFO L499 BasicCegarLoop]: 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-08 08:17:44,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:17:44,994 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:44,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 1 times [2022-04-08 08:17:44,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:44,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087565585] [2022-04-08 08:17:44,996 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 2 times [2022-04-08 08:17:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:44,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160441152] [2022-04-08 08:17:44,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:44,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:45,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {33661#true} is VALID [2022-04-08 08:17:45,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-08 08:17:45,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-08 08:17:45,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {33661#true} call ULTIMATE.init(); {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:45,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {33661#true} is VALID [2022-04-08 08:17:45,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-08 08:17:45,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-08 08:17:45,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {33661#true} call #t~ret16 := main(); {33661#true} is VALID [2022-04-08 08:17:45,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {33661#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; {33661#true} is VALID [2022-04-08 08:17:45,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {33661#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {33661#true} is VALID [2022-04-08 08:17:45,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {33661#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; {33661#true} is VALID [2022-04-08 08:17:45,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {33661#true} assume !(0 != ~p1~0); {33661#true} is VALID [2022-04-08 08:17:45,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {33661#true} assume !(0 != ~p2~0); {33661#true} is VALID [2022-04-08 08:17:45,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {33661#true} assume !(0 != ~p3~0); {33661#true} is VALID [2022-04-08 08:17:45,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {33661#true} assume !(0 != ~p4~0); {33661#true} is VALID [2022-04-08 08:17:45,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {33661#true} assume 0 != ~p5~0;~lk5~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:45,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {33662#false} is VALID [2022-04-08 08:17:45,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {33662#false} assume 0 != ~p6~0; {33662#false} is VALID [2022-04-08 08:17:45,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {33662#false} assume 1 != ~lk6~0; {33662#false} is VALID [2022-04-08 08:17:45,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {33662#false} assume !false; {33662#false} is VALID [2022-04-08 08:17:45,037 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-08 08:17:45,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160441152] [2022-04-08 08:17:45,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160441152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:45,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:45,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:45,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087565585] [2022-04-08 08:17:45,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087565585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:45,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:45,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659866072] [2022-04-08 08:17:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:45,038 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-08 08:17:45,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:45,038 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-08 08:17:45,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:45,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:45,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:45,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:45,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:45,053 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-08 08:17:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:45,366 INFO L93 Difference]: Finished difference Result 1597 states and 2569 transitions. [2022-04-08 08:17:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:45,366 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-08 08:17:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:45,366 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-08 08:17:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-08 08:17:45,368 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-08 08:17:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-08 08:17:45,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 193 transitions. [2022-04-08 08:17:45,470 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-08 08:17:45,566 INFO L225 Difference]: With dead ends: 1597 [2022-04-08 08:17:45,567 INFO L226 Difference]: Without dead ends: 1083 [2022-04-08 08:17:45,569 INFO L912 BasicCegarLoop]: 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-08 08:17:45,570 INFO L913 BasicCegarLoop]: 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-08 08:17:45,574 INFO L914 BasicCegarLoop]: 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-08 08:17:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-04-08 08:17:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2022-04-08 08:17:45,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:45,717 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-08 08:17:45,718 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-08 08:17:45,719 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-08 08:17:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:45,775 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-08 08:17:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-08 08:17:45,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:45,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:45,778 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-08 08:17:45,779 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-08 08:17:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:45,812 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-08 08:17:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-08 08:17:45,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:45,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:45,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:45,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:45,815 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-08 08:17:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2022-04-08 08:17:45,859 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2022-04-08 08:17:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:45,859 INFO L478 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2022-04-08 08:17:45,859 INFO L479 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-08 08:17:45,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1081 states and 1719 transitions. [2022-04-08 08:17:47,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2022-04-08 08:17:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:47,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:47,294 INFO L499 BasicCegarLoop]: 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-08 08:17:47,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:17:47,294 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 1 times [2022-04-08 08:17:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:47,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1337298737] [2022-04-08 08:17:47,297 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 2 times [2022-04-08 08:17:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:47,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366267373] [2022-04-08 08:17:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:47,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {41195#true} is VALID [2022-04-08 08:17:47,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 08:17:47,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-08 08:17:47,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:47,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {41195#true} is VALID [2022-04-08 08:17:47,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 08:17:47,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-08 08:17:47,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret16 := main(); {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#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; {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {41195#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#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; {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 != ~p1~0); {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume !(0 != ~p2~0); {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {41195#true} assume !(0 != ~p3~0); {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {41195#true} assume !(0 != ~p4~0); {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} assume !(0 != ~p5~0); {41195#true} is VALID [2022-04-08 08:17:47,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume 0 != ~p6~0;~lk6~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p6~0; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:47,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {41200#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {41196#false} is VALID [2022-04-08 08:17:47,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-08 08:17:47,372 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-08 08:17:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:47,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366267373] [2022-04-08 08:17:47,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366267373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:47,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:47,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:47,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:47,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1337298737] [2022-04-08 08:17:47,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1337298737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:47,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:47,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:47,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982718381] [2022-04-08 08:17:47,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:47,374 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-08 08:17:47,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:47,374 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-08 08:17:47,389 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-08 08:17:47,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:47,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:47,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:47,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:47,389 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-08 08:17:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:47,811 INFO L93 Difference]: Finished difference Result 1933 states and 3129 transitions. [2022-04-08 08:17:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:47,812 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-08 08:17:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:47,812 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-08 08:17:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 08:17:47,813 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-08 08:17:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 08:17:47,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 08:17:47,900 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-08 08:17:48,042 INFO L225 Difference]: With dead ends: 1933 [2022-04-08 08:17:48,051 INFO L226 Difference]: Without dead ends: 1931 [2022-04-08 08:17:48,052 INFO L912 BasicCegarLoop]: 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-08 08:17:48,052 INFO L913 BasicCegarLoop]: 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-08 08:17:48,052 INFO L914 BasicCegarLoop]: 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-08 08:17:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-08 08:17:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2022-04-08 08:17:48,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:48,143 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-08 08:17:48,146 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-08 08:17:48,147 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-08 08:17:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:48,352 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-08 08:17:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-08 08:17:48,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:48,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:48,356 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-08 08:17:48,357 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-08 08:17:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:48,453 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-08 08:17:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-08 08:17:48,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:48,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:48,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:48,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:48,457 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-08 08:17:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2022-04-08 08:17:48,556 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2022-04-08 08:17:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:48,556 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2022-04-08 08:17:48,556 INFO L479 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-08 08:17:48,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2391 transitions. [2022-04-08 08:17:50,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2391 edges. 2391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2022-04-08 08:17:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:50,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:50,732 INFO L499 BasicCegarLoop]: 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-08 08:17:50,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:17:50,733 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 1 times [2022-04-08 08:17:50,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:50,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589533206] [2022-04-08 08:17:50,733 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 2 times [2022-04-08 08:17:50,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:50,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913601755] [2022-04-08 08:17:50,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:50,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:50,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {52025#true} is VALID [2022-04-08 08:17:50,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-08 08:17:50,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {52025#true} call ULTIMATE.init(); {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:50,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {52025#true} call #t~ret16 := main(); {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {52025#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; {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {52025#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {52025#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; {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {52025#true} assume !(0 != ~p1~0); {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {52025#true} assume !(0 != ~p2~0); {52025#true} is VALID [2022-04-08 08:17:50,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {52025#true} assume !(0 != ~p3~0); {52025#true} is VALID [2022-04-08 08:17:50,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {52025#true} assume !(0 != ~p4~0); {52025#true} is VALID [2022-04-08 08:17:50,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {52025#true} assume !(0 != ~p5~0); {52025#true} is VALID [2022-04-08 08:17:50,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {52025#true} assume !(0 != ~p6~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p10~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p1~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p2~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p3~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p4~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p5~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:50,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p6~0; {52026#false} is VALID [2022-04-08 08:17:50,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {52026#false} assume 1 != ~lk6~0; {52026#false} is VALID [2022-04-08 08:17:50,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {52026#false} assume !false; {52026#false} is VALID [2022-04-08 08:17:50,785 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-08 08:17:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:50,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913601755] [2022-04-08 08:17:50,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913601755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:50,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:50,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:50,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:50,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589533206] [2022-04-08 08:17:50,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589533206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:50,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:50,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012935637] [2022-04-08 08:17:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:50,786 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-08 08:17:50,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:50,786 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-08 08:17:50,802 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-08 08:17:50,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:50,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:50,802 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-08 08:17:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:51,629 INFO L93 Difference]: Finished difference Result 3597 states and 5593 transitions. [2022-04-08 08:17:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:51,630 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-08 08:17:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:51,630 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-08 08:17:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-08 08:17:51,631 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-08 08:17:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-08 08:17:51,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-08 08:17:51,755 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-08 08:17:51,924 INFO L225 Difference]: With dead ends: 3597 [2022-04-08 08:17:51,925 INFO L226 Difference]: Without dead ends: 2091 [2022-04-08 08:17:51,927 INFO L912 BasicCegarLoop]: 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-08 08:17:51,927 INFO L913 BasicCegarLoop]: 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-08 08:17:51,927 INFO L914 BasicCegarLoop]: 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-08 08:17:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-08 08:17:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2022-04-08 08:17:52,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:52,056 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-08 08:17:52,057 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-08 08:17:52,059 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-08 08:17:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:52,167 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-08 08:17:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-08 08:17:52,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:52,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:52,172 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-08 08:17:52,173 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-08 08:17:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:52,292 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-08 08:17:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-08 08:17:52,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:52,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:52,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:52,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:52,297 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-08 08:17:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2022-04-08 08:17:52,475 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2022-04-08 08:17:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:52,475 INFO L478 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2022-04-08 08:17:52,475 INFO L479 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-08 08:17:52,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2089 states and 3207 transitions. [2022-04-08 08:17:54,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2022-04-08 08:17:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:17:54,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:54,991 INFO L499 BasicCegarLoop]: 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-08 08:17:54,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:17:54,991 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:54,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 1 times [2022-04-08 08:17:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:54,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1424874629] [2022-04-08 08:17:54,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 2 times [2022-04-08 08:17:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:54,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629643581] [2022-04-08 08:17:54,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:55,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {67591#true} is VALID [2022-04-08 08:17:55,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-08 08:17:55,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-08 08:17:55,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {67591#true} call ULTIMATE.init(); {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:55,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {67591#true} is VALID [2022-04-08 08:17:55,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-08 08:17:55,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-08 08:17:55,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {67591#true} call #t~ret16 := main(); {67591#true} is VALID [2022-04-08 08:17:55,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {67591#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; {67591#true} is VALID [2022-04-08 08:17:55,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {67591#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {67591#true} is VALID [2022-04-08 08:17:55,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {67591#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; {67591#true} is VALID [2022-04-08 08:17:55,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {67591#true} assume !(0 != ~p1~0); {67591#true} is VALID [2022-04-08 08:17:55,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {67591#true} assume !(0 != ~p2~0); {67591#true} is VALID [2022-04-08 08:17:55,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {67591#true} assume !(0 != ~p3~0); {67591#true} is VALID [2022-04-08 08:17:55,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {67591#true} assume !(0 != ~p4~0); {67591#true} is VALID [2022-04-08 08:17:55,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {67591#true} assume !(0 != ~p5~0); {67591#true} is VALID [2022-04-08 08:17:55,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {67591#true} assume 0 != ~p6~0;~lk6~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:17:55,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {67592#false} is VALID [2022-04-08 08:17:55,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {67592#false} assume 0 != ~p7~0; {67592#false} is VALID [2022-04-08 08:17:55,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {67592#false} assume 1 != ~lk7~0; {67592#false} is VALID [2022-04-08 08:17:55,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {67592#false} assume !false; {67592#false} is VALID [2022-04-08 08:17:55,046 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-08 08:17:55,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:55,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629643581] [2022-04-08 08:17:55,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629643581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:55,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:55,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:55,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:55,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1424874629] [2022-04-08 08:17:55,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1424874629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:55,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:55,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:55,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681240061] [2022-04-08 08:17:55,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:55,047 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-08 08:17:55,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:55,047 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-08 08:17:55,063 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-08 08:17:55,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:55,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:55,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:55,063 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-08 08:17:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:55,763 INFO L93 Difference]: Finished difference Result 3133 states and 4793 transitions. [2022-04-08 08:17:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:55,763 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-08 08:17:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:55,764 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-08 08:17:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-08 08:17:55,765 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-08 08:17:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-08 08:17:55,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-08 08:17:55,870 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-08 08:17:56,055 INFO L225 Difference]: With dead ends: 3133 [2022-04-08 08:17:56,056 INFO L226 Difference]: Without dead ends: 2123 [2022-04-08 08:17:56,057 INFO L912 BasicCegarLoop]: 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-08 08:17:56,057 INFO L913 BasicCegarLoop]: 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-08 08:17:56,058 INFO L914 BasicCegarLoop]: 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-08 08:17:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-08 08:17:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2022-04-08 08:17:56,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:56,192 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-08 08:17:56,194 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-08 08:17:56,195 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-08 08:17:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:56,311 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-08 08:17:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-08 08:17:56,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:56,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:56,316 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-08 08:17:56,318 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-08 08:17:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:56,455 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-08 08:17:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-08 08:17:56,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:56,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:56,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:56,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:56,459 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-08 08:17:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2022-04-08 08:17:56,636 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2022-04-08 08:17:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:56,637 INFO L478 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2022-04-08 08:17:56,637 INFO L479 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-08 08:17:56,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2121 states and 3207 transitions. [2022-04-08 08:17:59,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2022-04-08 08:17:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:17:59,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:59,701 INFO L499 BasicCegarLoop]: 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-08 08:17:59,701 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:17:59,701 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 1 times [2022-04-08 08:17:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:59,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1431655039] [2022-04-08 08:17:59,702 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 2 times [2022-04-08 08:17:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:59,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153260505] [2022-04-08 08:17:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:59,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:59,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {82357#true} is VALID [2022-04-08 08:17:59,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-08 08:17:59,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-08 08:17:59,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {82357#true} call ULTIMATE.init(); {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {82357#true} call #t~ret16 := main(); {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {82357#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; {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {82357#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {82357#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; {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {82357#true} assume !(0 != ~p1~0); {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {82357#true} assume !(0 != ~p2~0); {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {82357#true} assume !(0 != ~p3~0); {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {82357#true} assume !(0 != ~p4~0); {82357#true} is VALID [2022-04-08 08:17:59,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {82357#true} assume !(0 != ~p5~0); {82357#true} is VALID [2022-04-08 08:17:59,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {82357#true} assume !(0 != ~p6~0); {82357#true} is VALID [2022-04-08 08:17:59,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {82357#true} assume 0 != ~p7~0;~lk7~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p7~0; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 08:17:59,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {82362#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {82358#false} is VALID [2022-04-08 08:17:59,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {82358#false} assume !false; {82358#false} is VALID [2022-04-08 08:17:59,751 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-08 08:17:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:59,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153260505] [2022-04-08 08:17:59,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153260505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:59,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:59,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:59,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:59,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1431655039] [2022-04-08 08:17:59,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1431655039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:59,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:59,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014068634] [2022-04-08 08:17:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:59,752 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-08 08:17:59,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:59,753 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-08 08:17:59,766 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-08 08:17:59,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:59,767 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-08 08:18:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:00,767 INFO L93 Difference]: Finished difference Result 3725 states and 5737 transitions. [2022-04-08 08:18:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:00,767 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-08 08:18:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:00,767 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-08 08:18:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 08:18:00,768 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-08 08:18:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 08:18:00,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-08 08:18:00,836 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-08 08:18:01,415 INFO L225 Difference]: With dead ends: 3725 [2022-04-08 08:18:01,416 INFO L226 Difference]: Without dead ends: 3723 [2022-04-08 08:18:01,417 INFO L912 BasicCegarLoop]: 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-08 08:18:01,417 INFO L913 BasicCegarLoop]: 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-08 08:18:01,417 INFO L914 BasicCegarLoop]: 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-08 08:18:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-08 08:18:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2022-04-08 08:18:01,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:01,620 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-08 08:18:01,623 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-08 08:18:01,626 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-08 08:18:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:01,985 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-08 08:18:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-08 08:18:01,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:01,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:01,993 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-08 08:18:01,995 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-08 08:18:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:02,375 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-08 08:18:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-08 08:18:02,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:02,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:02,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:02,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:02,383 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-08 08:18:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2022-04-08 08:18:02,832 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2022-04-08 08:18:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:02,832 INFO L478 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2022-04-08 08:18:02,832 INFO L479 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-08 08:18:02,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3081 states and 4519 transitions. [2022-04-08 08:18:06,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4519 edges. 4519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2022-04-08 08:18:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:18:06,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:06,984 INFO L499 BasicCegarLoop]: 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-08 08:18:06,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:18:06,985 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 1 times [2022-04-08 08:18:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:06,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1738032199] [2022-04-08 08:18:06,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 2 times [2022-04-08 08:18:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:06,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038503604] [2022-04-08 08:18:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:07,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:07,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {103427#true} is VALID [2022-04-08 08:18:07,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-08 08:18:07,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-08 08:18:07,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {103427#true} call ULTIMATE.init(); {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:07,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {103427#true} is VALID [2022-04-08 08:18:07,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-08 08:18:07,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-08 08:18:07,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {103427#true} call #t~ret16 := main(); {103427#true} is VALID [2022-04-08 08:18:07,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {103427#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; {103427#true} is VALID [2022-04-08 08:18:07,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {103427#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {103427#true} is VALID [2022-04-08 08:18:07,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {103427#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; {103427#true} is VALID [2022-04-08 08:18:07,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {103427#true} assume !(0 != ~p1~0); {103427#true} is VALID [2022-04-08 08:18:07,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {103427#true} assume !(0 != ~p2~0); {103427#true} is VALID [2022-04-08 08:18:07,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {103427#true} assume !(0 != ~p3~0); {103427#true} is VALID [2022-04-08 08:18:07,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {103427#true} assume !(0 != ~p4~0); {103427#true} is VALID [2022-04-08 08:18:07,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {103427#true} assume !(0 != ~p5~0); {103427#true} is VALID [2022-04-08 08:18:07,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {103427#true} assume !(0 != ~p6~0); {103427#true} is VALID [2022-04-08 08:18:07,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {103427#true} assume !(0 != ~p7~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p10~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p1~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p2~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p3~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p4~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p5~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p6~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:07,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p7~0; {103428#false} is VALID [2022-04-08 08:18:07,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {103428#false} assume 1 != ~lk7~0; {103428#false} is VALID [2022-04-08 08:18:07,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {103428#false} assume !false; {103428#false} is VALID [2022-04-08 08:18:07,026 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-08 08:18:07,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:07,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038503604] [2022-04-08 08:18:07,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038503604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:07,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:07,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:07,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:07,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1738032199] [2022-04-08 08:18:07,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1738032199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:07,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:07,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:07,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986871583] [2022-04-08 08:18:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:07,027 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-08 08:18:07,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:07,027 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-08 08:18:07,042 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-08 08:18:07,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:07,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:07,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:07,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:07,043 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-08 08:18:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:09,605 INFO L93 Difference]: Finished difference Result 7117 states and 10473 transitions. [2022-04-08 08:18:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:09,605 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-08 08:18:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:09,605 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-08 08:18:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-08 08:18:09,606 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-08 08:18:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-08 08:18:09,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-08 08:18:09,723 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-08 08:18:10,431 INFO L225 Difference]: With dead ends: 7117 [2022-04-08 08:18:10,432 INFO L226 Difference]: Without dead ends: 4107 [2022-04-08 08:18:10,435 INFO L912 BasicCegarLoop]: 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-08 08:18:10,435 INFO L913 BasicCegarLoop]: 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-08 08:18:10,436 INFO L914 BasicCegarLoop]: 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-08 08:18:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-08 08:18:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2022-04-08 08:18:10,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:10,726 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-08 08:18:10,729 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-08 08:18:10,731 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-08 08:18:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:11,168 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-08 08:18:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-08 08:18:11,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:11,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:11,177 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-08 08:18:11,179 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-08 08:18:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:11,620 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-08 08:18:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-08 08:18:11,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:11,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:11,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:11,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:11,628 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-08 08:18:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2022-04-08 08:18:12,407 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2022-04-08 08:18:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:12,407 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2022-04-08 08:18:12,407 INFO L479 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-08 08:18:12,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 5959 transitions. [2022-04-08 08:18:18,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2022-04-08 08:18:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:18:18,197 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:18,197 INFO L499 BasicCegarLoop]: 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-08 08:18:18,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:18:18,198 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 1 times [2022-04-08 08:18:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:18,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600617147] [2022-04-08 08:18:18,198 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 2 times [2022-04-08 08:18:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:18,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039689457] [2022-04-08 08:18:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:18,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:18,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:18,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {134097#true} is VALID [2022-04-08 08:18:18,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-08 08:18:18,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-08 08:18:18,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {134097#true} call ULTIMATE.init(); {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:18,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {134097#true} is VALID [2022-04-08 08:18:18,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-08 08:18:18,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {134097#true} call #t~ret16 := main(); {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {134097#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; {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {134097#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {134097#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; {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {134097#true} assume !(0 != ~p1~0); {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {134097#true} assume !(0 != ~p2~0); {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {134097#true} assume !(0 != ~p3~0); {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {134097#true} assume !(0 != ~p4~0); {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {134097#true} assume !(0 != ~p5~0); {134097#true} is VALID [2022-04-08 08:18:18,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {134097#true} assume !(0 != ~p6~0); {134097#true} is VALID [2022-04-08 08:18:18,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {134097#true} assume 0 != ~p7~0;~lk7~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:18,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {134098#false} is VALID [2022-04-08 08:18:18,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {134098#false} assume 0 != ~p8~0; {134098#false} is VALID [2022-04-08 08:18:18,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {134098#false} assume 1 != ~lk8~0; {134098#false} is VALID [2022-04-08 08:18:18,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {134098#false} assume !false; {134098#false} is VALID [2022-04-08 08:18:18,230 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-08 08:18:18,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:18,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039689457] [2022-04-08 08:18:18,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039689457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:18,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:18,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:18,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:18,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600617147] [2022-04-08 08:18:18,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600617147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:18,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:18,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:18,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540711971] [2022-04-08 08:18:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:18,231 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-08 08:18:18,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:18,231 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-08 08:18:18,250 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-08 08:18:18,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:18,251 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-08 08:18:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:20,297 INFO L93 Difference]: Finished difference Result 6157 states and 8905 transitions. [2022-04-08 08:18:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:20,297 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-08 08:18:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:20,298 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-08 08:18:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 08:18:20,299 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-08 08:18:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 08:18:20,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-08 08:18:20,417 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-08 08:18:21,101 INFO L225 Difference]: With dead ends: 6157 [2022-04-08 08:18:21,102 INFO L226 Difference]: Without dead ends: 4171 [2022-04-08 08:18:21,104 INFO L912 BasicCegarLoop]: 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-08 08:18:21,106 INFO L913 BasicCegarLoop]: 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-08 08:18:21,106 INFO L914 BasicCegarLoop]: 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-08 08:18:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-04-08 08:18:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2022-04-08 08:18:21,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:21,417 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-08 08:18:21,419 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-08 08:18:21,422 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-08 08:18:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:21,868 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-08 08:18:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-08 08:18:21,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:21,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:21,876 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-08 08:18:21,879 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-08 08:18:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:22,330 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-08 08:18:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-08 08:18:22,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:22,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:22,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:22,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:22,339 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-08 08:18:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2022-04-08 08:18:23,134 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2022-04-08 08:18:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:23,135 INFO L478 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2022-04-08 08:18:23,135 INFO L479 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-08 08:18:23,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4169 states and 5959 transitions. [2022-04-08 08:18:28,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2022-04-08 08:18:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:18:28,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:28,558 INFO L499 BasicCegarLoop]: 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-08 08:18:28,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:18:28,558 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 1 times [2022-04-08 08:18:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:28,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893297922] [2022-04-08 08:18:28,559 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 2 times [2022-04-08 08:18:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:28,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258437201] [2022-04-08 08:18:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:28,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:28,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {163103#true} is VALID [2022-04-08 08:18:28,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-08 08:18:28,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-08 08:18:28,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {163103#true} call ULTIMATE.init(); {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {163103#true} call #t~ret16 := main(); {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {163103#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; {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {163103#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {163103#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; {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {163103#true} assume !(0 != ~p1~0); {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {163103#true} assume !(0 != ~p2~0); {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {163103#true} assume !(0 != ~p3~0); {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {163103#true} assume !(0 != ~p4~0); {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {163103#true} assume !(0 != ~p5~0); {163103#true} is VALID [2022-04-08 08:18:28,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {163103#true} assume !(0 != ~p6~0); {163103#true} is VALID [2022-04-08 08:18:28,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {163103#true} assume !(0 != ~p7~0); {163103#true} is VALID [2022-04-08 08:18:28,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {163103#true} assume 0 != ~p8~0;~lk8~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p8~0; {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:28,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {163108#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {163104#false} is VALID [2022-04-08 08:18:28,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {163104#false} assume !false; {163104#false} is VALID [2022-04-08 08:18:28,622 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-08 08:18:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:28,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258437201] [2022-04-08 08:18:28,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258437201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:28,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:28,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:28,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:28,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893297922] [2022-04-08 08:18:28,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893297922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:28,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:28,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:28,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126193762] [2022-04-08 08:18:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:28,623 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-08 08:18:28,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:28,623 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-08 08:18:28,633 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-08 08:18:28,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:28,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:28,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:28,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:28,634 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-08 08:18:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:31,433 INFO L93 Difference]: Finished difference Result 7181 states and 10441 transitions. [2022-04-08 08:18:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:31,433 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-08 08:18:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:31,433 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-08 08:18:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 08:18:31,434 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-08 08:18:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 08:18:31,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 08:18:31,497 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-08 08:18:33,580 INFO L225 Difference]: With dead ends: 7181 [2022-04-08 08:18:33,580 INFO L226 Difference]: Without dead ends: 7179 [2022-04-08 08:18:33,581 INFO L912 BasicCegarLoop]: 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-08 08:18:33,581 INFO L913 BasicCegarLoop]: 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-08 08:18:33,582 INFO L914 BasicCegarLoop]: 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-08 08:18:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2022-04-08 08:18:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2022-04-08 08:18:34,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:34,046 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-08 08:18:34,053 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-08 08:18:34,058 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-08 08:18:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:35,466 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-08 08:18:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-08 08:18:35,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:35,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:35,478 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-08 08:18:35,482 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-08 08:18:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:36,849 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-08 08:18:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-08 08:18:36,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:36,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:36,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:36,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:36,860 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-08 08:18:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2022-04-08 08:18:38,563 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2022-04-08 08:18:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:38,563 INFO L478 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2022-04-08 08:18:38,563 INFO L479 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-08 08:18:38,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6153 states and 8519 transitions. [2022-04-08 08:18:47,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8519 edges. 8519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2022-04-08 08:18:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:18:47,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:47,276 INFO L499 BasicCegarLoop]: 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-08 08:18:47,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:18:47,276 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 1 times [2022-04-08 08:18:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:47,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1400520134] [2022-04-08 08:18:47,277 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 2 times [2022-04-08 08:18:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:47,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575345155] [2022-04-08 08:18:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:47,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:47,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {204141#true} is VALID [2022-04-08 08:18:47,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-08 08:18:47,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-08 08:18:47,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {204141#true} call ULTIMATE.init(); {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:47,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {204141#true} call #t~ret16 := main(); {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {204141#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; {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {204141#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {204141#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; {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {204141#true} assume !(0 != ~p1~0); {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {204141#true} assume !(0 != ~p2~0); {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {204141#true} assume !(0 != ~p3~0); {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {204141#true} assume !(0 != ~p4~0); {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {204141#true} assume !(0 != ~p5~0); {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {204141#true} assume !(0 != ~p6~0); {204141#true} is VALID [2022-04-08 08:18:47,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {204141#true} assume !(0 != ~p7~0); {204141#true} is VALID [2022-04-08 08:18:47,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {204141#true} assume !(0 != ~p8~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p10~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p1~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p2~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p3~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p4~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p5~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p6~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p7~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:47,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p8~0; {204142#false} is VALID [2022-04-08 08:18:47,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {204142#false} assume 1 != ~lk8~0; {204142#false} is VALID [2022-04-08 08:18:47,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {204142#false} assume !false; {204142#false} is VALID [2022-04-08 08:18:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:47,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575345155] [2022-04-08 08:18:47,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575345155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:47,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:47,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:47,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:47,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1400520134] [2022-04-08 08:18:47,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1400520134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:47,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:47,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325760850] [2022-04-08 08:18:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:47,311 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-08 08:18:47,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:47,311 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-08 08:18:47,329 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-08 08:18:47,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:47,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:47,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:47,330 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-08 08:18:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:56,787 INFO L93 Difference]: Finished difference Result 14093 states and 19529 transitions. [2022-04-08 08:18:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:56,787 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-08 08:18:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:56,793 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-08 08:18:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-08 08:18:56,794 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-08 08:18:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-08 08:18:56,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-08 08:18:56,890 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-08 08:18:59,628 INFO L225 Difference]: With dead ends: 14093 [2022-04-08 08:18:59,628 INFO L226 Difference]: Without dead ends: 8075 [2022-04-08 08:18:59,634 INFO L912 BasicCegarLoop]: 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-08 08:18:59,636 INFO L913 BasicCegarLoop]: 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-08 08:18:59,636 INFO L914 BasicCegarLoop]: 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-08 08:18:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2022-04-08 08:19:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2022-04-08 08:19:00,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:00,267 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-08 08:19:00,275 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-08 08:19:00,283 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-08 08:19:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:02,030 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-08 08:19:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-08 08:19:02,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:02,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:02,044 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-08 08:19:02,050 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-08 08:19:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:03,818 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-08 08:19:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-08 08:19:03,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:03,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:03,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:03,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:03,834 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-08 08:19:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2022-04-08 08:19:06,667 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2022-04-08 08:19:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:06,667 INFO L478 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2022-04-08 08:19:06,667 INFO L479 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-08 08:19:06,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8073 states and 11015 transitions. [2022-04-08 08:19:17,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2022-04-08 08:19:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:19:17,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:17,040 INFO L499 BasicCegarLoop]: 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-08 08:19:17,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:19:17,040 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 1 times [2022-04-08 08:19:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:17,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142896816] [2022-04-08 08:19:17,041 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 2 times [2022-04-08 08:19:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:17,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497463573] [2022-04-08 08:19:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:17,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {264635#true} is VALID [2022-04-08 08:19:17,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-08 08:19:17,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {264635#true} call ULTIMATE.init(); {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:17,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {264635#true} call #t~ret16 := main(); {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {264635#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; {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {264635#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {264635#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; {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {264635#true} assume !(0 != ~p1~0); {264635#true} is VALID [2022-04-08 08:19:17,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {264635#true} assume !(0 != ~p2~0); {264635#true} is VALID [2022-04-08 08:19:17,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {264635#true} assume !(0 != ~p3~0); {264635#true} is VALID [2022-04-08 08:19:17,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {264635#true} assume !(0 != ~p4~0); {264635#true} is VALID [2022-04-08 08:19:17,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {264635#true} assume !(0 != ~p5~0); {264635#true} is VALID [2022-04-08 08:19:17,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {264635#true} assume !(0 != ~p6~0); {264635#true} is VALID [2022-04-08 08:19:17,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {264635#true} assume !(0 != ~p7~0); {264635#true} is VALID [2022-04-08 08:19:17,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {264635#true} assume 0 != ~p8~0;~lk8~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:17,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {264636#false} is VALID [2022-04-08 08:19:17,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {264636#false} assume 0 != ~p9~0; {264636#false} is VALID [2022-04-08 08:19:17,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {264636#false} assume 1 != ~lk9~0; {264636#false} is VALID [2022-04-08 08:19:17,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {264636#false} assume !false; {264636#false} is VALID [2022-04-08 08:19:17,074 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-08 08:19:17,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:17,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497463573] [2022-04-08 08:19:17,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497463573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:17,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:17,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:17,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:17,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [142896816] [2022-04-08 08:19:17,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [142896816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:17,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:17,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:17,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268252321] [2022-04-08 08:19:17,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:17,075 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-08 08:19:17,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:17,075 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-08 08:19:17,094 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-08 08:19:17,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:17,094 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-08 08:19:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:23,628 INFO L93 Difference]: Finished difference Result 12109 states and 16457 transitions. [2022-04-08 08:19:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:23,628 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-08 08:19:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:23,629 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-08 08:19:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 08:19:23,629 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-08 08:19:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 08:19:23,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-08 08:19:23,722 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-08 08:19:26,485 INFO L225 Difference]: With dead ends: 12109 [2022-04-08 08:19:26,486 INFO L226 Difference]: Without dead ends: 8203 [2022-04-08 08:19:26,491 INFO L912 BasicCegarLoop]: 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-08 08:19:26,491 INFO L913 BasicCegarLoop]: 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-08 08:19:26,493 INFO L914 BasicCegarLoop]: 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-08 08:19:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2022-04-08 08:19:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2022-04-08 08:19:27,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:27,141 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-08 08:19:27,148 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-08 08:19:27,155 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-08 08:19:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:28,843 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-08 08:19:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-08 08:19:28,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:28,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:28,858 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-08 08:19:28,865 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-08 08:19:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:30,589 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-08 08:19:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-08 08:19:30,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:30,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:30,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:30,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:30,604 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-08 08:19:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2022-04-08 08:19:33,497 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2022-04-08 08:19:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:33,497 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2022-04-08 08:19:33,497 INFO L479 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-08 08:19:33,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 11015 transitions. [2022-04-08 08:19:45,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2022-04-08 08:19:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:19:45,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:45,355 INFO L499 BasicCegarLoop]: 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-08 08:19:45,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:19:45,355 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 1 times [2022-04-08 08:19:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:45,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1762257302] [2022-04-08 08:19:45,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 2 times [2022-04-08 08:19:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:45,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958552206] [2022-04-08 08:19:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:45,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:45,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:45,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {321673#true} is VALID [2022-04-08 08:19:45,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-08 08:19:45,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-08 08:19:45,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {321673#true} call ULTIMATE.init(); {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:45,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {321673#true} is VALID [2022-04-08 08:19:45,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-08 08:19:45,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-08 08:19:45,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {321673#true} call #t~ret16 := main(); {321673#true} is VALID [2022-04-08 08:19:45,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {321673#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; {321673#true} is VALID [2022-04-08 08:19:45,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {321673#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {321673#true} is VALID [2022-04-08 08:19:45,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {321673#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; {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {321673#true} assume !(0 != ~p1~0); {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {321673#true} assume !(0 != ~p2~0); {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {321673#true} assume !(0 != ~p3~0); {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {321673#true} assume !(0 != ~p4~0); {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {321673#true} assume !(0 != ~p5~0); {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {321673#true} assume !(0 != ~p6~0); {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {321673#true} assume !(0 != ~p7~0); {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {321673#true} assume !(0 != ~p8~0); {321673#true} is VALID [2022-04-08 08:19:45,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {321673#true} assume 0 != ~p9~0;~lk9~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p9~0; {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 08:19:45,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {321678#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {321674#false} is VALID [2022-04-08 08:19:45,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {321674#false} assume !false; {321674#false} is VALID [2022-04-08 08:19:45,397 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-08 08:19:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:45,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958552206] [2022-04-08 08:19:45,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958552206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:45,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:45,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:45,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:45,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1762257302] [2022-04-08 08:19:45,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1762257302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:45,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:45,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553131429] [2022-04-08 08:19:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:45,399 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-08 08:19:45,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:45,400 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-08 08:19:45,416 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-08 08:19:45,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:45,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:45,417 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-08 08:19:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:55,142 INFO L93 Difference]: Finished difference Result 13837 states and 18825 transitions. [2022-04-08 08:19:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:55,142 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-08 08:19:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:55,143 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-08 08:19:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 08:19:55,144 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-08 08:19:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 08:19:55,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-08 08:19:55,208 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-08 08:20:03,303 INFO L225 Difference]: With dead ends: 13837 [2022-04-08 08:20:03,303 INFO L226 Difference]: Without dead ends: 13835 [2022-04-08 08:20:03,305 INFO L912 BasicCegarLoop]: 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-08 08:20:03,306 INFO L913 BasicCegarLoop]: 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-08 08:20:03,306 INFO L914 BasicCegarLoop]: 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-08 08:20:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-04-08 08:20:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2022-04-08 08:20:04,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:04,288 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-08 08:20:04,299 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-08 08:20:04,311 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-08 08:20:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:09,655 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-08 08:20:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-08 08:20:09,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:09,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:09,677 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-08 08:20:09,691 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-08 08:20:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:15,094 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-08 08:20:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-08 08:20:15,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:15,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:15,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:15,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:15,119 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-08 08:20:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2022-04-08 08:20:22,052 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2022-04-08 08:20:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:22,053 INFO L478 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2022-04-08 08:20:22,053 INFO L479 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-08 08:20:22,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12297 states and 16007 transitions. [2022-04-08 08:20:38,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16007 edges. 16007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2022-04-08 08:20:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:20:38,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:38,475 INFO L499 BasicCegarLoop]: 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-08 08:20:38,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:20:38,475 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 1 times [2022-04-08 08:20:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:38,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1418607710] [2022-04-08 08:20:38,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 2 times [2022-04-08 08:20:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:38,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916771518] [2022-04-08 08:20:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:38,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:38,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {401623#true} is VALID [2022-04-08 08:20:38,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-08 08:20:38,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-08 08:20:38,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {401623#true} call ULTIMATE.init(); {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:38,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {401623#true} is VALID [2022-04-08 08:20:38,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-08 08:20:38,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-08 08:20:38,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {401623#true} call #t~ret16 := main(); {401623#true} is VALID [2022-04-08 08:20:38,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {401623#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; {401623#true} is VALID [2022-04-08 08:20:38,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {401623#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {401623#true} is VALID [2022-04-08 08:20:38,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {401623#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; {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {401623#true} assume !(0 != ~p1~0); {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {401623#true} assume !(0 != ~p2~0); {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {401623#true} assume !(0 != ~p3~0); {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {401623#true} assume !(0 != ~p4~0); {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {401623#true} assume !(0 != ~p5~0); {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {401623#true} assume !(0 != ~p6~0); {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {401623#true} assume !(0 != ~p7~0); {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {401623#true} assume !(0 != ~p8~0); {401623#true} is VALID [2022-04-08 08:20:38,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {401623#true} assume !(0 != ~p9~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p10~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p1~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p2~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p3~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p4~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p5~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p6~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p7~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p8~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:38,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p9~0; {401624#false} is VALID [2022-04-08 08:20:38,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {401624#false} assume 1 != ~lk9~0; {401624#false} is VALID [2022-04-08 08:20:38,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {401624#false} assume !false; {401624#false} is VALID [2022-04-08 08:20:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:20:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:38,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916771518] [2022-04-08 08:20:38,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916771518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:38,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:38,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:38,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:38,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1418607710] [2022-04-08 08:20:38,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1418607710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:38,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:38,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:38,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640411966] [2022-04-08 08:20:38,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:38,507 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-08 08:20:38,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:38,507 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-08 08:20:38,523 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-08 08:20:38,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:38,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:38,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:38,524 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-08 08:21:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:20,442 INFO L93 Difference]: Finished difference Result 27917 states and 36233 transitions. [2022-04-08 08:21:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:21:20,442 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-08 08:21:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:21:20,442 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-08 08:21:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-08 08:21:20,443 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-08 08:21:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-08 08:21:20,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-08 08:21:20,559 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-08 08:21:31,102 INFO L225 Difference]: With dead ends: 27917 [2022-04-08 08:21:31,102 INFO L226 Difference]: Without dead ends: 15883 [2022-04-08 08:21:31,115 INFO L912 BasicCegarLoop]: 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-08 08:21:31,115 INFO L913 BasicCegarLoop]: 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-08 08:21:31,116 INFO L914 BasicCegarLoop]: 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-08 08:21:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2022-04-08 08:21:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2022-04-08 08:21:32,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:21:32,386 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-08 08:21:32,399 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-08 08:21:32,414 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-08 08:21:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:38,937 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-08 08:21:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-08 08:21:38,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:38,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:38,963 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-08 08:21:38,980 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-08 08:21:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:45,562 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-08 08:21:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-08 08:21:45,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:45,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:45,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:21:45,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:21:45,589 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-08 08:21:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2022-04-08 08:21:56,797 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2022-04-08 08:21:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:21:56,798 INFO L478 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2022-04-08 08:21:56,798 INFO L479 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-08 08:21:56,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15881 states and 20231 transitions. [2022-04-08 08:22:17,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2022-04-08 08:22:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:22:17,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:22:17,174 INFO L499 BasicCegarLoop]: 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-08 08:22:17,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:22:17,175 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:22:17,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:22:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 1 times [2022-04-08 08:22:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:17,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387378479] [2022-04-08 08:22:17,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:22:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 2 times [2022-04-08 08:22:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:22:17,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869316403] [2022-04-08 08:22:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:22:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:22:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:22:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:17,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {520997#true} is VALID [2022-04-08 08:22:17,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-08 08:22:17,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-08 08:22:17,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {520997#true} call ULTIMATE.init(); {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:22:17,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {520997#true} is VALID [2022-04-08 08:22:17,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-08 08:22:17,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-08 08:22:17,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {520997#true} call #t~ret16 := main(); {520997#true} is VALID [2022-04-08 08:22:17,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {520997#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; {520997#true} is VALID [2022-04-08 08:22:17,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {520997#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {520997#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; {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {520997#true} assume !(0 != ~p1~0); {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {520997#true} assume !(0 != ~p2~0); {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {520997#true} assume !(0 != ~p3~0); {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {520997#true} assume !(0 != ~p4~0); {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {520997#true} assume !(0 != ~p5~0); {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {520997#true} assume !(0 != ~p6~0); {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {520997#true} assume !(0 != ~p7~0); {520997#true} is VALID [2022-04-08 08:22:17,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {520997#true} assume !(0 != ~p8~0); {520997#true} is VALID [2022-04-08 08:22:17,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {520997#true} assume 0 != ~p9~0;~lk9~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {521002#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:22:17,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {520998#false} is VALID [2022-04-08 08:22:17,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {520998#false} assume 0 != ~p10~0; {520998#false} is VALID [2022-04-08 08:22:17,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {520998#false} assume 1 != ~lk10~0; {520998#false} is VALID [2022-04-08 08:22:17,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {520998#false} assume !false; {520998#false} is VALID [2022-04-08 08:22:17,222 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-08 08:22:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:22:17,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869316403] [2022-04-08 08:22:17,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869316403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:17,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:17,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:17,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:22:17,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [387378479] [2022-04-08 08:22:17,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [387378479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:17,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:17,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523352799] [2022-04-08 08:22:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:22:17,225 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-08 08:22:17,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:22:17,225 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-08 08:22:17,235 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-08 08:22:17,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:22:17,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:22:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:22:17,236 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-08 08:22:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:42,469 INFO L93 Difference]: Finished difference Result 23821 states and 30217 transitions. [2022-04-08 08:22:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:22:42,469 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-08 08:22:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:22:42,470 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-08 08:22:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-08 08:22:42,471 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-08 08:22:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-08 08:22:42,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-08 08:22:42,562 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-08 08:22:53,432 INFO L225 Difference]: With dead ends: 23821 [2022-04-08 08:22:53,433 INFO L226 Difference]: Without dead ends: 16139 [2022-04-08 08:22:53,444 INFO L912 BasicCegarLoop]: 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-08 08:22:53,445 INFO L913 BasicCegarLoop]: 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-08 08:22:53,446 INFO L914 BasicCegarLoop]: 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-08 08:22:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2022-04-08 08:22:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2022-04-08 08:22:54,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:22:54,788 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-08 08:22:54,801 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-08 08:22:54,815 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-08 08:23:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:23:01,957 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-08 08:23:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-08 08:23:01,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:23:01,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:23:01,984 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-08 08:23:01,998 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-08 08:23:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:23:09,219 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-08 08:23:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-08 08:23:09,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:23:09,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:23:09,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:23:09,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:23:09,245 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-08 08:23:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2022-04-08 08:23:20,670 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2022-04-08 08:23:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:23:20,670 INFO L478 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2022-04-08 08:23:20,670 INFO L479 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-08 08:23:20,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16137 states and 20231 transitions. [2022-04-08 08:23:40,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:23:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2022-04-08 08:23:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:23:40,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:23:40,503 INFO L499 BasicCegarLoop]: 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-08 08:23:40,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:23:40,503 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:23:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:23:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 1 times [2022-04-08 08:23:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:23:40,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [21629886] [2022-04-08 08:23:40,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:23:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 2 times [2022-04-08 08:23:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:23:40,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595376053] [2022-04-08 08:23:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:23:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:23:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:23:40,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:23:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:23:40,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {633203#true} is VALID [2022-04-08 08:23:40,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-08 08:23:40,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-08 08:23:40,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {633203#true} call ULTIMATE.init(); {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:23:40,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {633203#true} is VALID [2022-04-08 08:23:40,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-08 08:23:40,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {633203#true} call #t~ret16 := main(); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {633203#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; {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {633203#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {633203#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; {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {633203#true} assume !(0 != ~p1~0); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {633203#true} assume !(0 != ~p2~0); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {633203#true} assume !(0 != ~p3~0); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {633203#true} assume !(0 != ~p4~0); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {633203#true} assume !(0 != ~p5~0); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {633203#true} assume !(0 != ~p6~0); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {633203#true} assume !(0 != ~p7~0); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {633203#true} assume !(0 != ~p8~0); {633203#true} is VALID [2022-04-08 08:23:40,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {633203#true} assume !(0 != ~p9~0); {633203#true} is VALID [2022-04-08 08:23:40,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {633203#true} assume !(0 != ~p10~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p1~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p2~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p3~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p4~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p5~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p6~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p7~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p8~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p9~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 08:23:40,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p10~0; {633204#false} is VALID [2022-04-08 08:23:40,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {633204#false} assume 1 != ~lk10~0; {633204#false} is VALID [2022-04-08 08:23:40,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {633204#false} assume !false; {633204#false} is VALID [2022-04-08 08:23:40,558 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-08 08:23:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:23:40,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595376053] [2022-04-08 08:23:40,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595376053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:23:40,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:23:40,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:23:40,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:23:40,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [21629886] [2022-04-08 08:23:40,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [21629886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:23:40,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:23:40,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:23:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904605625] [2022-04-08 08:23:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:23:40,559 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-08 08:23:40,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:23:40,559 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-08 08:23:40,572 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-08 08:23:40,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:23:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:23:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:23:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:23:40,573 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-08 08:27:33,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:33,544 INFO L93 Difference]: Finished difference Result 46861 states and 57609 transitions. [2022-04-08 08:27:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:27:33,545 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-08 08:27:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:27:33,546 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-08 08:27:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 08:27:33,547 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-08 08:27:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 08:27:33,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-08 08:27:33,664 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-08 08:28:20,795 INFO L225 Difference]: With dead ends: 46861 [2022-04-08 08:28:20,795 INFO L226 Difference]: Without dead ends: 31243 [2022-04-08 08:28:20,816 INFO L912 BasicCegarLoop]: 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-08 08:28:20,817 INFO L913 BasicCegarLoop]: 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-08 08:28:20,817 INFO L914 BasicCegarLoop]: 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-08 08:28:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2022-04-08 08:28:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31241. [2022-04-08 08:28:23,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:28:23,591 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-08 08:28:23,631 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-08 08:28:23,671 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-08 08:28:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:28:50,271 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-08 08:28:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-08 08:28:50,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:28:50,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:28:50,329 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-08 08:28:50,369 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-08 08:29:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:29:18,560 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-08 08:29:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-08 08:29:18,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:29:18,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:29:18,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:29:18,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:29:18,698 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-08 08:30:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 37383 transitions. [2022-04-08 08:30:08,947 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 37383 transitions. Word has length 31 [2022-04-08 08:30:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:30:08,947 INFO L478 AbstractCegarLoop]: Abstraction has 31241 states and 37383 transitions. [2022-04-08 08:30:08,947 INFO L479 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-08 08:30:08,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31241 states and 37383 transitions. [2022-04-08 08:30:48,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37383 edges. 37383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:30:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 37383 transitions. [2022-04-08 08:30:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:30:48,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:30:48,708 INFO L499 BasicCegarLoop]: 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-08 08:30:48,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:30:48,709 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:30:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:30:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1627320854, now seen corresponding path program 1 times [2022-04-08 08:30:48,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:30:48,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955024930] [2022-04-08 08:30:48,710 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:30:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1627320854, now seen corresponding path program 2 times [2022-04-08 08:30:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:30:48,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822076183] [2022-04-08 08:30:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:30:48,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:30:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:30:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:48,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {851911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {851905#true} is VALID [2022-04-08 08:30:48,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {851905#true} assume true; {851905#true} is VALID [2022-04-08 08:30:48,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {851905#true} {851905#true} #217#return; {851905#true} is VALID [2022-04-08 08:30:48,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {851905#true} call ULTIMATE.init(); {851911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {851911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {851905#true} assume true; {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851905#true} {851905#true} #217#return; {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {851905#true} call #t~ret16 := main(); {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {851905#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; {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {851905#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {851905#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; {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {851905#true} assume !(0 != ~p1~0); {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {851905#true} assume !(0 != ~p2~0); {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {851905#true} assume !(0 != ~p3~0); {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {851905#true} assume !(0 != ~p4~0); {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {851905#true} assume !(0 != ~p5~0); {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {851905#true} assume !(0 != ~p6~0); {851905#true} is VALID [2022-04-08 08:30:48,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {851905#true} assume !(0 != ~p7~0); {851905#true} is VALID [2022-04-08 08:30:48,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {851905#true} assume !(0 != ~p8~0); {851905#true} is VALID [2022-04-08 08:30:48,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {851905#true} assume !(0 != ~p9~0); {851905#true} is VALID [2022-04-08 08:30:48,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {851905#true} assume 0 != ~p10~0;~lk10~0 := 1; {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {851910#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {851910#(= main_~lk10~0 1)} assume 0 != ~p10~0; {851910#(= main_~lk10~0 1)} is VALID [2022-04-08 08:30:48,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {851910#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {851906#false} is VALID [2022-04-08 08:30:48,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {851906#false} assume !false; {851906#false} is VALID [2022-04-08 08:30:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:30:48,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:30:48,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822076183] [2022-04-08 08:30:48,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822076183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:30:48,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:30:48,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:30:48,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:30:48,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955024930] [2022-04-08 08:30:48,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955024930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:30:48,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:30:48,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:30:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6679690] [2022-04-08 08:30:48,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:30:48,738 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-08 08:30:48,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:30:48,738 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-08 08:30:48,753 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-08 08:30:48,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:30:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:30:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:30:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:30:48,754 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-08 08:31:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:57,463 INFO L93 Difference]: Finished difference Result 33293 states and 40457 transitions. [2022-04-08 08:31:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:31:57,463 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-08 08:31:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:31:57,464 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-08 08:31:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-04-08 08:31:57,465 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-08 08:31:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-04-08 08:31:57,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 104 transitions. [2022-04-08 08:31:57,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.