/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:57:45,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:57:45,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:57:45,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:57:45,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:57:45,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:57:45,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:57:45,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:57:45,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:57:45,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:57:45,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:57:45,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:57:45,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:57:45,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:57:45,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:57:45,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:57:45,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:57:45,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:57:45,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:57:45,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:57:45,443 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:57:45,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:57:45,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:57:45,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:57:45,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:57:45,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:57:45,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:57:45,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:57:45,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:57:45,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:57:45,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:57:45,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:57:45,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:57:45,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:57:45,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:57:45,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:57:45,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:57:45,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:57:45,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:57:45,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:57:45,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:57:45,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:57:45,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:57:45,472 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:57:45,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:57:45,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:57:45,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:57:45,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:57:45,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:57:45,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:57:45,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:57:45,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:57:45,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:57:45,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:57:45,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:57:45,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:57:45,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:57:45,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:57:45,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:57:45,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:57:45,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:57:45,476 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:57:45,476 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:57:45,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:57:45,476 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:57:45,476 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 14:57:45,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:57:45,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:57:45,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:57:45,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:57:45,751 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:57:45,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-08 14:57:45,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3b8e29b/02860546498f4a38a5c85cdb26e107cf/FLAGc56a546dd [2022-04-08 14:57:46,200 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:57:46,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-08 14:57:46,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3b8e29b/02860546498f4a38a5c85cdb26e107cf/FLAGc56a546dd [2022-04-08 14:57:46,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3b8e29b/02860546498f4a38a5c85cdb26e107cf [2022-04-08 14:57:46,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:57:46,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:57:46,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:57:46,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:57:46,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:57:46,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2833bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46, skipping insertion in model container [2022-04-08 14:57:46,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:57:46,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:57:46,779 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_15-2.c[5628,5641] [2022-04-08 14:57:46,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:57:46,790 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:57:46,847 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_15-2.c[5628,5641] [2022-04-08 14:57:46,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:57:46,864 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:57:46,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46 WrapperNode [2022-04-08 14:57:46,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:57:46,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:57:46,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:57:46,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:57:46,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:57:46,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:57:46,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:57:46,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:57:46,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (1/1) ... [2022-04-08 14:57:46,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:57:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:57:46,972 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 14:57:46,987 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 14:57:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:57:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:57:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:57:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:57:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:57:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:57:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:57:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:57:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:57:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:57:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:57:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:57:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:57:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:57:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:57:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:57:47,067 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:57:47,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:57:47,419 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:57:47,425 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:57:47,425 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:57:47,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:57:47 BoogieIcfgContainer [2022-04-08 14:57:47,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:57:47,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:57:47,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:57:47,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:57:47,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:57:46" (1/3) ... [2022-04-08 14:57:47,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585f4eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:57:47, skipping insertion in model container [2022-04-08 14:57:47,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:57:46" (2/3) ... [2022-04-08 14:57:47,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585f4eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:57:47, skipping insertion in model container [2022-04-08 14:57:47,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:57:47" (3/3) ... [2022-04-08 14:57:47,441 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2022-04-08 14:57:47,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:57:47,445 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:57:47,494 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:57:47,501 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 14:57:47,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:57:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 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 14:57:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:57:47,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:47,537 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 14:57:47,537 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:47,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 1 times [2022-04-08 14:57:47,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:47,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573601450] [2022-04-08 14:57:47,563 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:47,563 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 2 times [2022-04-08 14:57:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:47,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322545394] [2022-04-08 14:57:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:47,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-08 14:57:47,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-08 14:57:47,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-08 14:57:47,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:47,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-08 14:57:47,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-08 14:57:47,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-08 14:57:47,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret20 := main(); {63#true} is VALID [2022-04-08 14:57:47,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {63#true} is VALID [2022-04-08 14:57:47,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {63#true} is VALID [2022-04-08 14:57:47,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {63#true} is VALID [2022-04-08 14:57:47,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} assume 0 != ~p1~0;~lk1~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p1~0; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:47,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {64#false} is VALID [2022-04-08 14:57:47,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-04-08 14:57:47,898 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 14:57:47,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:47,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322545394] [2022-04-08 14:57:47,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322545394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:47,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:47,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:47,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:47,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573601450] [2022-04-08 14:57:47,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573601450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:47,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:47,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630912989] [2022-04-08 14:57:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:47,907 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 14:57:47,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:47,911 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 14:57:47,943 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 14:57:47,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:47,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:47,986 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.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 14:57:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:48,459 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-04-08 14:57:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:48,460 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 14:57:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:48,461 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 14:57:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 14:57:48,471 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 14:57:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 14:57:48,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-08 14:57:48,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:48,742 INFO L225 Difference]: With dead ends: 118 [2022-04-08 14:57:48,743 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 14:57:48,746 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 14:57:48,766 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:48,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 119 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 14:57:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-08 14:57:48,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:48,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states 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 14:57:48,804 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states 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 14:57:48,805 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states 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 14:57:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:48,812 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-08 14:57:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-08 14:57:48,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:48,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:48,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-08 14:57:48,814 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-08 14:57:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:48,821 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-08 14:57:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-08 14:57:48,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:48,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:48,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:48,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states 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 14:57:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-08 14:57:48,828 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-08 14:57:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:48,828 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-08 14:57:48,829 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 14:57:48,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 130 transitions. [2022-04-08 14:57:48,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-08 14:57:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:57:48,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:48,980 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 14:57:48,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:57:48,980 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 1 times [2022-04-08 14:57:48,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:48,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1098354731] [2022-04-08 14:57:48,982 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 2 times [2022-04-08 14:57:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:48,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763290423] [2022-04-08 14:57:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:49,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:49,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-08 14:57:49,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 14:57:49,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-08 14:57:49,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:49,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-08 14:57:49,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 14:57:49,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-08 14:57:49,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret20 := main(); {659#true} is VALID [2022-04-08 14:57:49,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {659#true} is VALID [2022-04-08 14:57:49,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {659#true} is VALID [2022-04-08 14:57:49,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {659#true} is VALID [2022-04-08 14:57:49,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 != ~p1~0); {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p2~0); {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p10~0); {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:49,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p1~0; {660#false} is VALID [2022-04-08 14:57:49,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {660#false} assume 1 != ~lk1~0; {660#false} is VALID [2022-04-08 14:57:49,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-08 14:57:49,070 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 14:57:49,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:49,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763290423] [2022-04-08 14:57:49,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763290423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:49,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:49,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:49,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:49,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1098354731] [2022-04-08 14:57:49,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1098354731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:49,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:49,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:49,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020955769] [2022-04-08 14:57:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:49,073 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 14:57:49,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:49,073 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 14:57:49,095 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 14:57:49,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:49,096 INFO L87 Difference]: Start difference. First operand 71 states and 130 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 14:57:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:49,403 INFO L93 Difference]: Finished difference Result 168 states and 313 transitions. [2022-04-08 14:57:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:49,403 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 14:57:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:49,404 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 14:57:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-08 14:57:49,409 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 14:57:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-08 14:57:49,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 282 transitions. [2022-04-08 14:57:49,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:49,656 INFO L225 Difference]: With dead ends: 168 [2022-04-08 14:57:49,656 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 14:57:49,656 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 14:57:49,657 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:49,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 135 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 14:57:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-08 14:57:49,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:49,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states 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 14:57:49,672 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states 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 14:57:49,673 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states 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 14:57:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:49,682 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-08 14:57:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-08 14:57:49,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:49,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:49,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-08 14:57:49,683 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-08 14:57:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:49,688 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-08 14:57:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-08 14:57:49,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:49,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:49,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:49,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states 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 14:57:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2022-04-08 14:57:49,693 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2022-04-08 14:57:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:49,693 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2022-04-08 14:57:49,693 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 14:57:49,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 186 transitions. [2022-04-08 14:57:49,888 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 14:57:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2022-04-08 14:57:49,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:57:49,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:49,892 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 14:57:49,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:57:49,895 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:49,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 1 times [2022-04-08 14:57:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:49,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1399798743] [2022-04-08 14:57:49,904 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:49,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 2 times [2022-04-08 14:57:49,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:49,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318439713] [2022-04-08 14:57:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:49,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:50,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-08 14:57:50,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-08 14:57:50,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-08 14:57:50,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {1415#true} call ULTIMATE.init(); {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:50,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-08 14:57:50,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-08 14:57:50,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-08 14:57:50,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {1415#true} call #t~ret20 := main(); {1415#true} is VALID [2022-04-08 14:57:50,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {1415#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {1415#true} is VALID [2022-04-08 14:57:50,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {1415#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {1415#true} is VALID [2022-04-08 14:57:50,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {1415#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1415#true} is VALID [2022-04-08 14:57:50,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#true} assume 0 != ~p1~0;~lk1~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:50,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1416#false} is VALID [2022-04-08 14:57:50,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {1416#false} assume 0 != ~p2~0; {1416#false} is VALID [2022-04-08 14:57:50,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {1416#false} assume 1 != ~lk2~0; {1416#false} is VALID [2022-04-08 14:57:50,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2022-04-08 14:57:50,062 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 14:57:50,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:50,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318439713] [2022-04-08 14:57:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318439713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:50,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:50,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:50,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1399798743] [2022-04-08 14:57:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1399798743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:50,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:50,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937649824] [2022-04-08 14:57:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:50,064 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 14:57:50,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:50,065 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 14:57:50,086 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 14:57:50,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:50,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:50,087 INFO L87 Difference]: Start difference. First operand 101 states and 186 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 14:57:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:50,362 INFO L93 Difference]: Finished difference Result 154 states and 280 transitions. [2022-04-08 14:57:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:50,363 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 14:57:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:50,363 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 14:57:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-08 14:57:50,367 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 14:57:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-08 14:57:50,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 277 transitions. [2022-04-08 14:57:50,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:50,593 INFO L225 Difference]: With dead ends: 154 [2022-04-08 14:57:50,593 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 14:57:50,593 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 14:57:50,594 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:50,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 163 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 14:57:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-08 14:57:50,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:50,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states 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 14:57:50,609 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states 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 14:57:50,609 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states 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 14:57:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:50,613 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-08 14:57:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-08 14:57:50,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:50,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:50,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-08 14:57:50,614 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-08 14:57:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:50,618 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-08 14:57:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-08 14:57:50,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:50,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:50,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:50,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states 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 14:57:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-08 14:57:50,623 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2022-04-08 14:57:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:50,623 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-08 14:57:50,624 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 14:57:50,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 188 transitions. [2022-04-08 14:57:50,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-08 14:57:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:57:50,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:50,801 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 14:57:50,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:57:50,803 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 1 times [2022-04-08 14:57:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:50,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992319966] [2022-04-08 14:57:50,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 2 times [2022-04-08 14:57:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:50,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982683676] [2022-04-08 14:57:50,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:50,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-08 14:57:50,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 14:57:50,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-08 14:57:50,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:50,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-08 14:57:50,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 14:57:50,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-08 14:57:50,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret20 := main(); {2155#true} is VALID [2022-04-08 14:57:50,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {2155#true} is VALID [2022-04-08 14:57:50,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {2155#true} is VALID [2022-04-08 14:57:50,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {2155#true} is VALID [2022-04-08 14:57:50,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 != ~p1~0); {2155#true} is VALID [2022-04-08 14:57:50,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume !(0 != ~p2~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:50,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p2~0; {2156#false} is VALID [2022-04-08 14:57:50,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {2156#false} assume 1 != ~lk2~0; {2156#false} is VALID [2022-04-08 14:57:50,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-08 14:57:50,928 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 14:57:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:50,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982683676] [2022-04-08 14:57:50,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982683676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:50,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:50,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:50,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:50,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992319966] [2022-04-08 14:57:50,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992319966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:50,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:50,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015032422] [2022-04-08 14:57:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:50,931 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 14:57:50,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:50,933 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 14:57:50,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:50,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:50,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:50,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:50,953 INFO L87 Difference]: Start difference. First operand 104 states and 188 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 14:57:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:51,265 INFO L93 Difference]: Finished difference Result 292 states and 540 transitions. [2022-04-08 14:57:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:51,266 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 14:57:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:51,266 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 14:57:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-08 14:57:51,270 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 14:57:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-08 14:57:51,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 280 transitions. [2022-04-08 14:57:51,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:51,526 INFO L225 Difference]: With dead ends: 292 [2022-04-08 14:57:51,526 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 14:57:51,527 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 14:57:51,527 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 248 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:51,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 109 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 14:57:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-08 14:57:51,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:51,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states 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 14:57:51,547 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states 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 14:57:51,547 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states 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 14:57:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:51,554 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-08 14:57:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-08 14:57:51,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:51,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:51,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 197 states. [2022-04-08 14:57:51,556 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 197 states. [2022-04-08 14:57:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:51,564 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-08 14:57:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-08 14:57:51,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:51,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:51,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:51,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states 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 14:57:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2022-04-08 14:57:51,573 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2022-04-08 14:57:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:51,573 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2022-04-08 14:57:51,573 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 14:57:51,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 357 transitions. [2022-04-08 14:57:51,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2022-04-08 14:57:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:57:51,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:51,916 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 14:57:51,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:57:51,916 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 1 times [2022-04-08 14:57:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:51,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017131822] [2022-04-08 14:57:51,917 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 2 times [2022-04-08 14:57:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:51,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284823419] [2022-04-08 14:57:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:51,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:51,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-08 14:57:51,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-08 14:57:51,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-08 14:57:51,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {3535#true} call ULTIMATE.init(); {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:51,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-08 14:57:51,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-08 14:57:51,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-08 14:57:51,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {3535#true} call #t~ret20 := main(); {3535#true} is VALID [2022-04-08 14:57:51,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {3535#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {3535#true} is VALID [2022-04-08 14:57:51,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {3535#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {3535#true} is VALID [2022-04-08 14:57:51,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {3535#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {3535#true} is VALID [2022-04-08 14:57:51,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {3535#true} assume !(0 != ~p1~0); {3535#true} is VALID [2022-04-08 14:57:51,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {3535#true} assume 0 != ~p2~0;~lk2~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:51,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:51,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:51,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:51,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:52,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {3540#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3536#false} is VALID [2022-04-08 14:57:52,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#false} assume !false; {3536#false} is VALID [2022-04-08 14:57:52,004 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 14:57:52,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:52,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284823419] [2022-04-08 14:57:52,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284823419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:52,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:52,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:52,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:52,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1017131822] [2022-04-08 14:57:52,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1017131822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:52,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:52,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:52,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799619404] [2022-04-08 14:57:52,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:52,006 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 14:57:52,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:52,007 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 14:57:52,025 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 14:57:52,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:52,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:52,026 INFO L87 Difference]: Start difference. First operand 195 states and 357 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 14:57:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:52,314 INFO L93 Difference]: Finished difference Result 255 states and 467 transitions. [2022-04-08 14:57:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:52,314 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 14:57:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:52,315 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 14:57:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 14:57:52,317 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 14:57:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 14:57:52,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-08 14:57:52,503 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 14:57:52,517 INFO L225 Difference]: With dead ends: 255 [2022-04-08 14:57:52,518 INFO L226 Difference]: Without dead ends: 253 [2022-04-08 14:57:52,518 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 14:57:52,519 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:52,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-08 14:57:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2022-04-08 14:57:52,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:52,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states 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 14:57:52,539 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states 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 14:57:52,540 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states 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 14:57:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:52,554 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-08 14:57:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-08 14:57:52,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:52,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:52,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-08 14:57:52,556 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-08 14:57:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:52,570 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-08 14:57:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-08 14:57:52,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:52,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:52,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:52,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states 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 14:57:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2022-04-08 14:57:52,582 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2022-04-08 14:57:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:52,582 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2022-04-08 14:57:52,583 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 14:57:52,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 355 transitions. [2022-04-08 14:57:52,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2022-04-08 14:57:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:57:52,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:52,960 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 14:57:52,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:57:52,961 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:52,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 1 times [2022-04-08 14:57:52,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:52,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342174426] [2022-04-08 14:57:52,962 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 2 times [2022-04-08 14:57:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:52,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929237271] [2022-04-08 14:57:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:52,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:53,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-08 14:57:53,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-08 14:57:53,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-08 14:57:53,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {4953#true} call ULTIMATE.init(); {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:53,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-08 14:57:53,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-08 14:57:53,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-08 14:57:53,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {4953#true} call #t~ret20 := main(); {4953#true} is VALID [2022-04-08 14:57:53,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {4953#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {4953#true} is VALID [2022-04-08 14:57:53,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {4953#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {4953#true} is VALID [2022-04-08 14:57:53,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {4953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {4953#true} is VALID [2022-04-08 14:57:53,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {4953#true} assume !(0 != ~p1~0); {4953#true} is VALID [2022-04-08 14:57:53,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {4953#true} assume !(0 != ~p2~0); {4953#true} is VALID [2022-04-08 14:57:53,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {4953#true} assume 0 != ~p3~0;~lk3~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:53,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {4958#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4954#false} is VALID [2022-04-08 14:57:53,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {4954#false} assume !false; {4954#false} is VALID [2022-04-08 14:57:53,024 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 14:57:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929237271] [2022-04-08 14:57:53,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929237271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:53,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:53,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:53,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342174426] [2022-04-08 14:57:53,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342174426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:53,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:53,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267800595] [2022-04-08 14:57:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:53,025 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 14:57:53,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:53,026 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 14:57:53,046 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 14:57:53,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:53,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:53,047 INFO L87 Difference]: Start difference. First operand 195 states and 355 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 14:57:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:53,319 INFO L93 Difference]: Finished difference Result 371 states and 683 transitions. [2022-04-08 14:57:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:53,320 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 14:57:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:53,320 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 14:57:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 14:57:53,322 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 14:57:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 14:57:53,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-08 14:57:53,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:53,475 INFO L225 Difference]: With dead ends: 371 [2022-04-08 14:57:53,475 INFO L226 Difference]: Without dead ends: 369 [2022-04-08 14:57:53,475 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 14:57:53,476 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 239 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:53,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-08 14:57:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2022-04-08 14:57:53,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:53,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states 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 14:57:53,500 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states 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 14:57:53,500 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states 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 14:57:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:53,509 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-08 14:57:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-08 14:57:53,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:53,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:53,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-08 14:57:53,512 INFO L87 Difference]: Start difference. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-08 14:57:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:53,521 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-08 14:57:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-08 14:57:53,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:53,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:53,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:53,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states 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 14:57:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2022-04-08 14:57:53,541 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2022-04-08 14:57:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:53,541 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2022-04-08 14:57:53,542 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 14:57:53,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 477 transitions. [2022-04-08 14:57:54,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2022-04-08 14:57:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:57:54,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:54,003 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 14:57:54,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:57:54,003 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:54,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:54,003 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 1 times [2022-04-08 14:57:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:54,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457795506] [2022-04-08 14:57:54,004 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 2 times [2022-04-08 14:57:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:54,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547017747] [2022-04-08 14:57:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:54,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:54,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:54,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-08 14:57:54,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-08 14:57:54,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-08 14:57:54,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {6971#true} call ULTIMATE.init(); {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:54,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-08 14:57:54,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-08 14:57:54,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-08 14:57:54,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {6971#true} call #t~ret20 := main(); {6971#true} is VALID [2022-04-08 14:57:54,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {6971#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {6971#true} is VALID [2022-04-08 14:57:54,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {6971#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {6971#true} is VALID [2022-04-08 14:57:54,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {6971#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {6971#true} is VALID [2022-04-08 14:57:54,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {6971#true} assume !(0 != ~p1~0); {6971#true} is VALID [2022-04-08 14:57:54,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {6971#true} assume !(0 != ~p2~0); {6971#true} is VALID [2022-04-08 14:57:54,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {6971#true} assume !(0 != ~p3~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:54,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p3~0; {6972#false} is VALID [2022-04-08 14:57:54,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {6972#false} assume 1 != ~lk3~0; {6972#false} is VALID [2022-04-08 14:57:54,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {6972#false} assume !false; {6972#false} is VALID [2022-04-08 14:57:54,064 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 14:57:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:54,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547017747] [2022-04-08 14:57:54,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547017747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:54,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:54,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:54,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:54,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457795506] [2022-04-08 14:57:54,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457795506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:54,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:54,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:54,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24238531] [2022-04-08 14:57:54,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:54,066 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 14:57:54,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:54,066 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 14:57:54,084 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 14:57:54,084 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:54,085 INFO L87 Difference]: Start difference. First operand 263 states and 477 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 14:57:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:54,371 INFO L93 Difference]: Finished difference Result 631 states and 1155 transitions. [2022-04-08 14:57:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:54,371 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 14:57:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:54,372 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 14:57:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-08 14:57:54,374 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 14:57:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-08 14:57:54,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 276 transitions. [2022-04-08 14:57:54,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:54,588 INFO L225 Difference]: With dead ends: 631 [2022-04-08 14:57:54,588 INFO L226 Difference]: Without dead ends: 377 [2022-04-08 14:57:54,590 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 14:57:54,590 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:54,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-08 14:57:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-04-08 14:57:54,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:54,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states 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 14:57:54,644 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states 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 14:57:54,645 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states 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 14:57:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:54,656 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-08 14:57:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-08 14:57:54,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:54,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:54,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-08 14:57:54,659 INFO L87 Difference]: Start difference. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 377 states. [2022-04-08 14:57:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:54,671 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-08 14:57:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-08 14:57:54,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:54,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:54,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:54,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states 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 14:57:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2022-04-08 14:57:54,684 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2022-04-08 14:57:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:54,684 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2022-04-08 14:57:54,684 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 14:57:54,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 679 transitions. [2022-04-08 14:57:55,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2022-04-08 14:57:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:57:55,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:55,295 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 14:57:55,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 14:57:55,295 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 1 times [2022-04-08 14:57:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:55,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2139445762] [2022-04-08 14:57:55,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 2 times [2022-04-08 14:57:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:55,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738734584] [2022-04-08 14:57:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:55,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:55,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-08 14:57:55,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-08 14:57:55,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-08 14:57:55,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {9749#true} call ULTIMATE.init(); {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:55,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-08 14:57:55,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-08 14:57:55,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-08 14:57:55,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {9749#true} call #t~ret20 := main(); {9749#true} is VALID [2022-04-08 14:57:55,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {9749#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {9749#true} is VALID [2022-04-08 14:57:55,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {9749#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {9749#true} is VALID [2022-04-08 14:57:55,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {9749#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {9749#true} is VALID [2022-04-08 14:57:55,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {9749#true} assume !(0 != ~p1~0); {9749#true} is VALID [2022-04-08 14:57:55,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {9749#true} assume !(0 != ~p2~0); {9749#true} is VALID [2022-04-08 14:57:55,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {9749#true} assume 0 != ~p3~0;~lk3~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:55,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9750#false} is VALID [2022-04-08 14:57:55,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {9750#false} assume 0 != ~p4~0; {9750#false} is VALID [2022-04-08 14:57:55,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {9750#false} assume 1 != ~lk4~0; {9750#false} is VALID [2022-04-08 14:57:55,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {9750#false} assume !false; {9750#false} is VALID [2022-04-08 14:57:55,359 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 14:57:55,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:55,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738734584] [2022-04-08 14:57:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738734584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:55,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:55,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:55,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2139445762] [2022-04-08 14:57:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2139445762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:55,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:55,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719916751] [2022-04-08 14:57:55,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:55,361 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 14:57:55,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:55,361 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 14:57:55,379 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 14:57:55,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:55,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:55,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:55,380 INFO L87 Difference]: Start difference. First operand 375 states and 679 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 14:57:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:55,668 INFO L93 Difference]: Finished difference Result 565 states and 1021 transitions. [2022-04-08 14:57:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:55,668 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 14:57:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:55,669 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 14:57:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-08 14:57:55,671 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 14:57:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-08 14:57:55,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 271 transitions. [2022-04-08 14:57:55,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:55,882 INFO L225 Difference]: With dead ends: 565 [2022-04-08 14:57:55,882 INFO L226 Difference]: Without dead ends: 383 [2022-04-08 14:57:55,883 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 14:57:55,883 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:55,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-08 14:57:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2022-04-08 14:57:55,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:55,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states 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 14:57:55,910 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states 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 14:57:55,911 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states 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 14:57:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:55,921 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-08 14:57:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-08 14:57:55,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:55,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:55,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-08 14:57:55,924 INFO L87 Difference]: Start difference. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 383 states. [2022-04-08 14:57:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:55,934 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-08 14:57:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-08 14:57:55,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:55,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:55,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:55,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states 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 14:57:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2022-04-08 14:57:55,946 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2022-04-08 14:57:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:55,947 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2022-04-08 14:57:55,947 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 14:57:55,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 683 transitions. [2022-04-08 14:57:56,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2022-04-08 14:57:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:57:56,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:56,633 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 14:57:56,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 14:57:56,633 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 1 times [2022-04-08 14:57:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:56,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725895793] [2022-04-08 14:57:56,635 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:56,638 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 2 times [2022-04-08 14:57:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:56,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333763288] [2022-04-08 14:57:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:56,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-08 14:57:56,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-08 14:57:56,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-08 14:57:56,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {12419#true} call ULTIMATE.init(); {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:56,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-08 14:57:56,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-08 14:57:56,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-08 14:57:56,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {12419#true} call #t~ret20 := main(); {12419#true} is VALID [2022-04-08 14:57:56,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {12419#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {12419#true} is VALID [2022-04-08 14:57:56,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {12419#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {12419#true} is VALID [2022-04-08 14:57:56,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {12419#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {12419#true} is VALID [2022-04-08 14:57:56,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {12419#true} assume !(0 != ~p1~0); {12419#true} is VALID [2022-04-08 14:57:56,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {12419#true} assume !(0 != ~p2~0); {12419#true} is VALID [2022-04-08 14:57:56,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {12419#true} assume !(0 != ~p3~0); {12419#true} is VALID [2022-04-08 14:57:56,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {12419#true} assume 0 != ~p4~0;~lk4~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p4~0; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:56,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {12424#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {12420#false} is VALID [2022-04-08 14:57:56,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {12420#false} assume !false; {12420#false} is VALID [2022-04-08 14:57:56,704 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 14:57:56,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:56,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333763288] [2022-04-08 14:57:56,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333763288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:56,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:56,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:56,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:56,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725895793] [2022-04-08 14:57:56,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725895793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:56,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:56,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:56,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975969796] [2022-04-08 14:57:56,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:56,705 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 14:57:56,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:56,706 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 14:57:56,724 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 14:57:56,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:56,725 INFO L87 Difference]: Start difference. First operand 381 states and 683 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 14:57:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:57,034 INFO L93 Difference]: Finished difference Result 717 states and 1301 transitions. [2022-04-08 14:57:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:57,034 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 14:57:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:57,035 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 14:57:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-08 14:57:57,037 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 14:57:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-08 14:57:57,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-04-08 14:57:57,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:57,225 INFO L225 Difference]: With dead ends: 717 [2022-04-08 14:57:57,225 INFO L226 Difference]: Without dead ends: 715 [2022-04-08 14:57:57,226 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 14:57:57,228 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:57,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-08 14:57:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2022-04-08 14:57:57,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:57,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states 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 14:57:57,270 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states 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 14:57:57,271 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states 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 14:57:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:57,297 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-08 14:57:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-08 14:57:57,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:57,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:57,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-08 14:57:57,315 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-08 14:57:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:57,341 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-08 14:57:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-08 14:57:57,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:57,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:57,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:57,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states 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 14:57:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2022-04-08 14:57:57,365 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2022-04-08 14:57:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:57,365 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2022-04-08 14:57:57,365 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 14:57:57,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 923 transitions. [2022-04-08 14:57:58,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2022-04-08 14:57:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:57:58,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:58,275 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 14:57:58,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 14:57:58,276 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:58,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:58,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 1 times [2022-04-08 14:57:58,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:58,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558187619] [2022-04-08 14:57:58,277 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 2 times [2022-04-08 14:57:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:58,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114364616] [2022-04-08 14:57:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:58,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:58,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:58,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-08 14:57:58,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-08 14:57:58,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-08 14:57:58,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {16337#true} call ULTIMATE.init(); {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:58,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-08 14:57:58,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-08 14:57:58,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-08 14:57:58,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {16337#true} call #t~ret20 := main(); {16337#true} is VALID [2022-04-08 14:57:58,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {16337#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {16337#true} is VALID [2022-04-08 14:57:58,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {16337#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {16337#true} is VALID [2022-04-08 14:57:58,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {16337#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {16337#true} is VALID [2022-04-08 14:57:58,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {16337#true} assume !(0 != ~p1~0); {16337#true} is VALID [2022-04-08 14:57:58,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {16337#true} assume !(0 != ~p2~0); {16337#true} is VALID [2022-04-08 14:57:58,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {16337#true} assume !(0 != ~p3~0); {16337#true} is VALID [2022-04-08 14:57:58,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {16337#true} assume !(0 != ~p4~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p10~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p1~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p2~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p3~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:58,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p4~0; {16338#false} is VALID [2022-04-08 14:57:58,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {16338#false} assume 1 != ~lk4~0; {16338#false} is VALID [2022-04-08 14:57:58,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {16338#false} assume !false; {16338#false} is VALID [2022-04-08 14:57:58,338 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 14:57:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:58,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114364616] [2022-04-08 14:57:58,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114364616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:58,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:58,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:58,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:58,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558187619] [2022-04-08 14:57:58,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558187619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:58,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:58,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036990351] [2022-04-08 14:57:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:58,341 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 14:57:58,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:58,341 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 14:57:58,360 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 14:57:58,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:58,361 INFO L87 Difference]: Start difference. First operand 521 states and 923 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 14:57:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:58,762 INFO L93 Difference]: Finished difference Result 1245 states and 2221 transitions. [2022-04-08 14:57:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:58,762 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 14:57:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:58,763 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 14:57:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-08 14:57:58,766 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 14:57:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-08 14:57:58,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 273 transitions. [2022-04-08 14:57:58,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:59,004 INFO L225 Difference]: With dead ends: 1245 [2022-04-08 14:57:59,006 INFO L226 Difference]: Without dead ends: 739 [2022-04-08 14:57:59,007 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 14:57:59,007 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:59,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 141 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-04-08 14:57:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-04-08 14:57:59,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:59,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states 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 14:57:59,066 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states 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 14:57:59,069 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states 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 14:57:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:59,097 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-08 14:57:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-08 14:57:59,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:59,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:59,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 739 states. [2022-04-08 14:57:59,103 INFO L87 Difference]: Start difference. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 739 states. [2022-04-08 14:57:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:59,131 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-08 14:57:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-08 14:57:59,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:59,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:59,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:59,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states 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 14:57:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2022-04-08 14:57:59,169 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2022-04-08 14:57:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:59,169 INFO L478 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2022-04-08 14:57:59,169 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 14:57:59,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 737 states and 1303 transitions. [2022-04-08 14:58:00,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2022-04-08 14:58:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:58:00,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:00,397 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 14:58:00,398 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 14:58:00,398 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 1 times [2022-04-08 14:58:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:00,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [988996599] [2022-04-08 14:58:00,399 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 2 times [2022-04-08 14:58:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:00,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734725914] [2022-04-08 14:58:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:00,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-08 14:58:00,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-08 14:58:00,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-08 14:58:00,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {21791#true} call ULTIMATE.init(); {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:00,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-08 14:58:00,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-08 14:58:00,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-08 14:58:00,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {21791#true} call #t~ret20 := main(); {21791#true} is VALID [2022-04-08 14:58:00,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {21791#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {21791#true} is VALID [2022-04-08 14:58:00,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {21791#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {21791#true} is VALID [2022-04-08 14:58:00,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {21791#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {21791#true} is VALID [2022-04-08 14:58:00,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {21791#true} assume !(0 != ~p1~0); {21791#true} is VALID [2022-04-08 14:58:00,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {21791#true} assume !(0 != ~p2~0); {21791#true} is VALID [2022-04-08 14:58:00,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {21791#true} assume !(0 != ~p3~0); {21791#true} is VALID [2022-04-08 14:58:00,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {21791#true} assume 0 != ~p4~0;~lk4~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:00,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {21792#false} is VALID [2022-04-08 14:58:00,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {21792#false} assume 0 != ~p5~0; {21792#false} is VALID [2022-04-08 14:58:00,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {21792#false} assume 1 != ~lk5~0; {21792#false} is VALID [2022-04-08 14:58:00,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {21792#false} assume !false; {21792#false} is VALID [2022-04-08 14:58:00,471 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 14:58:00,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:00,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734725914] [2022-04-08 14:58:00,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734725914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:00,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:00,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:00,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:00,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [988996599] [2022-04-08 14:58:00,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [988996599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:00,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:00,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243911051] [2022-04-08 14:58:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:00,473 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 14:58:00,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:00,473 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 14:58:00,512 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 14:58:00,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:00,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:00,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:00,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:00,514 INFO L87 Difference]: Start difference. First operand 737 states and 1303 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 14:58:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:00,863 INFO L93 Difference]: Finished difference Result 1105 states and 1949 transitions. [2022-04-08 14:58:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:00,863 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 14:58:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:00,864 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 14:58:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-08 14:58:00,866 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 14:58:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-08 14:58:00,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 268 transitions. [2022-04-08 14:58:01,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:01,102 INFO L225 Difference]: With dead ends: 1105 [2022-04-08 14:58:01,103 INFO L226 Difference]: Without dead ends: 747 [2022-04-08 14:58:01,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 14:58:01,105 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:01,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 154 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-08 14:58:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2022-04-08 14:58:01,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:01,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states 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 14:58:01,165 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states 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 14:58:01,193 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states 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 14:58:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:01,222 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-08 14:58:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-08 14:58:01,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:01,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:01,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-08 14:58:01,226 INFO L87 Difference]: Start difference. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 747 states. [2022-04-08 14:58:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:01,253 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-08 14:58:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-08 14:58:01,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:01,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:01,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:01,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states 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 14:58:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2022-04-08 14:58:01,293 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2022-04-08 14:58:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:01,293 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2022-04-08 14:58:01,293 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 14:58:01,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1303 transitions. [2022-04-08 14:58:02,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2022-04-08 14:58:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:58:02,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:02,686 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 14:58:02,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 14:58:02,686 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 1 times [2022-04-08 14:58:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:02,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1097945467] [2022-04-08 14:58:02,688 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 2 times [2022-04-08 14:58:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:02,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684079667] [2022-04-08 14:58:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:02,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:02,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-08 14:58:02,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-08 14:58:02,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-08 14:58:02,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {26997#true} call ULTIMATE.init(); {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:02,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-08 14:58:02,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-08 14:58:02,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-08 14:58:02,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {26997#true} call #t~ret20 := main(); {26997#true} is VALID [2022-04-08 14:58:02,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {26997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {26997#true} is VALID [2022-04-08 14:58:02,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {26997#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {26997#true} is VALID [2022-04-08 14:58:02,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {26997#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {26997#true} is VALID [2022-04-08 14:58:02,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {26997#true} assume !(0 != ~p1~0); {26997#true} is VALID [2022-04-08 14:58:02,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {26997#true} assume !(0 != ~p2~0); {26997#true} is VALID [2022-04-08 14:58:02,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {26997#true} assume !(0 != ~p3~0); {26997#true} is VALID [2022-04-08 14:58:02,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {26997#true} assume !(0 != ~p4~0); {26997#true} is VALID [2022-04-08 14:58:02,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {26997#true} assume 0 != ~p5~0;~lk5~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p5~0; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:02,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {27002#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {26998#false} is VALID [2022-04-08 14:58:02,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {26998#false} assume !false; {26998#false} is VALID [2022-04-08 14:58:02,756 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 14:58:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:02,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684079667] [2022-04-08 14:58:02,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684079667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:02,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:02,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:02,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:02,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1097945467] [2022-04-08 14:58:02,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1097945467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:02,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:02,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569323039] [2022-04-08 14:58:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:02,757 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 14:58:02,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:02,759 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 14:58:02,780 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 14:58:02,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:02,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:02,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:02,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:02,781 INFO L87 Difference]: Start difference. First operand 745 states and 1303 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 14:58:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:03,215 INFO L93 Difference]: Finished difference Result 1389 states and 2465 transitions. [2022-04-08 14:58:03,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:03,215 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 14:58:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:03,215 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 14:58:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 14:58:03,217 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 14:58:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 14:58:03,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-08 14:58:03,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:03,489 INFO L225 Difference]: With dead ends: 1389 [2022-04-08 14:58:03,489 INFO L226 Difference]: Without dead ends: 1387 [2022-04-08 14:58:03,490 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 14:58:03,491 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:03,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-04-08 14:58:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2022-04-08 14:58:03,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:03,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states 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 14:58:03,578 INFO L74 IsIncluded]: Start isIncluded. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states 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 14:58:03,579 INFO L87 Difference]: Start difference. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states 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 14:58:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:03,652 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-08 14:58:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-08 14:58:03,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:03,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:03,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1387 states. [2022-04-08 14:58:03,658 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1387 states. [2022-04-08 14:58:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:03,735 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-08 14:58:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-08 14:58:03,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:03,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:03,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:03,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states 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 14:58:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2022-04-08 14:58:03,792 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2022-04-08 14:58:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:03,792 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2022-04-08 14:58:03,792 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 14:58:03,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1775 transitions. [2022-04-08 14:58:05,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1775 edges. 1775 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2022-04-08 14:58:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:58:05,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:05,418 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 14:58:05,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 14:58:05,418 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 1 times [2022-04-08 14:58:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:05,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811398351] [2022-04-08 14:58:05,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 2 times [2022-04-08 14:58:05,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:05,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145225556] [2022-04-08 14:58:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:05,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:05,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:05,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-08 14:58:05,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-08 14:58:05,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-08 14:58:05,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {34627#true} call ULTIMATE.init(); {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:05,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-08 14:58:05,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-08 14:58:05,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-08 14:58:05,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {34627#true} call #t~ret20 := main(); {34627#true} is VALID [2022-04-08 14:58:05,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {34627#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {34627#true} is VALID [2022-04-08 14:58:05,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {34627#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {34627#true} is VALID [2022-04-08 14:58:05,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {34627#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {34627#true} is VALID [2022-04-08 14:58:05,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {34627#true} assume !(0 != ~p1~0); {34627#true} is VALID [2022-04-08 14:58:05,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {34627#true} assume !(0 != ~p2~0); {34627#true} is VALID [2022-04-08 14:58:05,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {34627#true} assume !(0 != ~p3~0); {34627#true} is VALID [2022-04-08 14:58:05,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#true} assume !(0 != ~p4~0); {34627#true} is VALID [2022-04-08 14:58:05,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {34627#true} assume !(0 != ~p5~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p10~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p1~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p2~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p3~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p4~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:05,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p5~0; {34628#false} is VALID [2022-04-08 14:58:05,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {34628#false} assume 1 != ~lk5~0; {34628#false} is VALID [2022-04-08 14:58:05,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {34628#false} assume !false; {34628#false} is VALID [2022-04-08 14:58:05,471 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 14:58:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:05,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145225556] [2022-04-08 14:58:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145225556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:05,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:05,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:05,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:05,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811398351] [2022-04-08 14:58:05,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811398351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:05,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:05,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839829020] [2022-04-08 14:58:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:05,473 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 14:58:05,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:05,473 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 14:58:05,490 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 14:58:05,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:05,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:05,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:05,491 INFO L87 Difference]: Start difference. First operand 1033 states and 1775 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 14:58:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:06,085 INFO L93 Difference]: Finished difference Result 2461 states and 4257 transitions. [2022-04-08 14:58:06,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:06,086 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 14:58:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:06,086 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 14:58:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-08 14:58:06,089 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 14:58:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-08 14:58:06,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 270 transitions. [2022-04-08 14:58:06,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:06,368 INFO L225 Difference]: With dead ends: 2461 [2022-04-08 14:58:06,368 INFO L226 Difference]: Without dead ends: 1451 [2022-04-08 14:58:06,370 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 14:58:06,370 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 199 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:06,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-08 14:58:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-08 14:58:06,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:06,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states 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 14:58:06,520 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states 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 14:58:06,521 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states 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 14:58:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:06,578 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-08 14:58:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-08 14:58:06,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:06,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:06,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-08 14:58:06,584 INFO L87 Difference]: Start difference. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-08 14:58:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:06,670 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-08 14:58:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-08 14:58:06,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:06,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:06,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:06,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states 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 14:58:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2022-04-08 14:58:06,805 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2022-04-08 14:58:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:06,805 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2022-04-08 14:58:06,805 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 14:58:06,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2487 transitions. [2022-04-08 14:58:09,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2022-04-08 14:58:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 14:58:09,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:09,226 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 14:58:09,226 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 14:58:09,226 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 1 times [2022-04-08 14:58:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:09,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472916800] [2022-04-08 14:58:09,228 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:09,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 2 times [2022-04-08 14:58:09,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:09,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743592725] [2022-04-08 14:58:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:09,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-08 14:58:09,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-08 14:58:09,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-08 14:58:09,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {45361#true} call ULTIMATE.init(); {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:09,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-08 14:58:09,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-08 14:58:09,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-08 14:58:09,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {45361#true} call #t~ret20 := main(); {45361#true} is VALID [2022-04-08 14:58:09,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {45361#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {45361#true} is VALID [2022-04-08 14:58:09,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {45361#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {45361#true} is VALID [2022-04-08 14:58:09,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {45361#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {45361#true} is VALID [2022-04-08 14:58:09,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {45361#true} assume !(0 != ~p1~0); {45361#true} is VALID [2022-04-08 14:58:09,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {45361#true} assume !(0 != ~p2~0); {45361#true} is VALID [2022-04-08 14:58:09,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {45361#true} assume !(0 != ~p3~0); {45361#true} is VALID [2022-04-08 14:58:09,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {45361#true} assume !(0 != ~p4~0); {45361#true} is VALID [2022-04-08 14:58:09,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {45361#true} assume 0 != ~p5~0;~lk5~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:09,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {45362#false} is VALID [2022-04-08 14:58:09,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {45362#false} assume 0 != ~p6~0; {45362#false} is VALID [2022-04-08 14:58:09,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {45362#false} assume 1 != ~lk6~0; {45362#false} is VALID [2022-04-08 14:58:09,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {45362#false} assume !false; {45362#false} is VALID [2022-04-08 14:58:09,283 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 14:58:09,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:09,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743592725] [2022-04-08 14:58:09,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743592725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:09,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:09,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:09,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:09,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472916800] [2022-04-08 14:58:09,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472916800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:09,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:09,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267141151] [2022-04-08 14:58:09,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:09,285 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 14:58:09,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:09,285 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 14:58:09,307 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 14:58:09,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:09,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:09,308 INFO L87 Difference]: Start difference. First operand 1449 states and 2487 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 14:58:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:09,817 INFO L93 Difference]: Finished difference Result 2173 states and 3721 transitions. [2022-04-08 14:58:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:09,817 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 14:58:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:09,817 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 14:58:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-08 14:58:09,819 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 14:58:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-08 14:58:09,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 265 transitions. [2022-04-08 14:58:09,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:10,072 INFO L225 Difference]: With dead ends: 2173 [2022-04-08 14:58:10,072 INFO L226 Difference]: Without dead ends: 1467 [2022-04-08 14:58:10,073 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 14:58:10,074 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 192 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:10,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 151 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-08 14:58:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2022-04-08 14:58:10,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:10,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states 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 14:58:10,196 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states 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 14:58:10,197 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states 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 14:58:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:10,280 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-08 14:58:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-08 14:58:10,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:10,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:10,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1467 states. [2022-04-08 14:58:10,286 INFO L87 Difference]: Start difference. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1467 states. [2022-04-08 14:58:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:10,371 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-08 14:58:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-08 14:58:10,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:10,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:10,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:10,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states 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 14:58:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2022-04-08 14:58:10,520 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2022-04-08 14:58:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:10,521 INFO L478 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2022-04-08 14:58:10,521 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 14:58:10,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1465 states and 2487 transitions. [2022-04-08 14:58:13,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2022-04-08 14:58:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 14:58:13,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:13,015 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 14:58:13,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 14:58:13,015 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:13,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 1 times [2022-04-08 14:58:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:13,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [959807656] [2022-04-08 14:58:13,016 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 2 times [2022-04-08 14:58:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:13,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646088610] [2022-04-08 14:58:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:13,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-08 14:58:13,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-08 14:58:13,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-08 14:58:13,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {55583#true} call ULTIMATE.init(); {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:13,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-08 14:58:13,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-08 14:58:13,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-08 14:58:13,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {55583#true} call #t~ret20 := main(); {55583#true} is VALID [2022-04-08 14:58:13,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {55583#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {55583#true} is VALID [2022-04-08 14:58:13,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {55583#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {55583#true} is VALID [2022-04-08 14:58:13,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {55583#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {55583#true} is VALID [2022-04-08 14:58:13,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {55583#true} assume !(0 != ~p1~0); {55583#true} is VALID [2022-04-08 14:58:13,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {55583#true} assume !(0 != ~p2~0); {55583#true} is VALID [2022-04-08 14:58:13,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {55583#true} assume !(0 != ~p3~0); {55583#true} is VALID [2022-04-08 14:58:13,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {55583#true} assume !(0 != ~p4~0); {55583#true} is VALID [2022-04-08 14:58:13,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {55583#true} assume !(0 != ~p5~0); {55583#true} is VALID [2022-04-08 14:58:13,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {55583#true} assume 0 != ~p6~0;~lk6~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p6~0; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:13,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {55588#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {55584#false} is VALID [2022-04-08 14:58:13,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {55584#false} assume !false; {55584#false} is VALID [2022-04-08 14:58:13,065 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 14:58:13,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:13,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646088610] [2022-04-08 14:58:13,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646088610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:13,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:13,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:13,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:13,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [959807656] [2022-04-08 14:58:13,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [959807656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:13,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:13,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702371605] [2022-04-08 14:58:13,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:13,067 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 14:58:13,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:13,067 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 14:58:13,085 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 14:58:13,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:13,086 INFO L87 Difference]: Start difference. First operand 1465 states and 2487 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 14:58:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:13,771 INFO L93 Difference]: Finished difference Result 2701 states and 4665 transitions. [2022-04-08 14:58:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:13,772 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 14:58:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 14:58:13,773 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 14:58:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 14:58:13,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-08 14:58:13,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:14,220 INFO L225 Difference]: With dead ends: 2701 [2022-04-08 14:58:14,220 INFO L226 Difference]: Without dead ends: 2699 [2022-04-08 14:58:14,221 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 14:58:14,221 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:14,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 103 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-08 14:58:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2022-04-08 14:58:14,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:14,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states 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 14:58:14,384 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states 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 14:58:14,387 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states 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 14:58:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:14,673 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-08 14:58:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-08 14:58:14,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:14,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:14,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-08 14:58:14,688 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-08 14:58:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:14,895 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-08 14:58:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-08 14:58:14,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:14,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:14,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:14,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states 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 14:58:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2022-04-08 14:58:15,133 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2022-04-08 14:58:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:15,133 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2022-04-08 14:58:15,133 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 14:58:15,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 3415 transitions. [2022-04-08 14:58:18,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3415 edges. 3415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2022-04-08 14:58:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 14:58:18,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:18,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, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:18,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 14:58:18,384 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 1 times [2022-04-08 14:58:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:18,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774210858] [2022-04-08 14:58:18,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 2 times [2022-04-08 14:58:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:18,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974374705] [2022-04-08 14:58:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:18,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-08 14:58:18,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-08 14:58:18,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-08 14:58:18,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {70509#true} call ULTIMATE.init(); {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:18,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-08 14:58:18,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-08 14:58:18,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {70509#true} call #t~ret20 := main(); {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {70509#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {70509#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {70509#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {70509#true} assume !(0 != ~p1~0); {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {70509#true} assume !(0 != ~p2~0); {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {70509#true} assume !(0 != ~p3~0); {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {70509#true} assume !(0 != ~p4~0); {70509#true} is VALID [2022-04-08 14:58:18,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {70509#true} assume !(0 != ~p5~0); {70509#true} is VALID [2022-04-08 14:58:18,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {70509#true} assume !(0 != ~p6~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p10~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p1~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p2~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p3~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p4~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p5~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:18,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p6~0; {70510#false} is VALID [2022-04-08 14:58:18,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {70510#false} assume 1 != ~lk6~0; {70510#false} is VALID [2022-04-08 14:58:18,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {70510#false} assume !false; {70510#false} is VALID [2022-04-08 14:58:18,456 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 14:58:18,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:18,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974374705] [2022-04-08 14:58:18,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974374705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:18,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:18,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:18,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774210858] [2022-04-08 14:58:18,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774210858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:18,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:18,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:18,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61799117] [2022-04-08 14:58:18,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:18,460 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 14:58:18,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:18,460 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 14:58:18,479 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 14:58:18,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:18,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:18,480 INFO L87 Difference]: Start difference. First operand 2057 states and 3415 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 14:58:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:19,900 INFO L93 Difference]: Finished difference Result 4877 states and 8153 transitions. [2022-04-08 14:58:19,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:19,901 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 14:58:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:19,901 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 14:58:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-08 14:58:19,902 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 14:58:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-08 14:58:19,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2022-04-08 14:58:20,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:20,398 INFO L225 Difference]: With dead ends: 4877 [2022-04-08 14:58:20,398 INFO L226 Difference]: Without dead ends: 2859 [2022-04-08 14:58:20,401 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 14:58:20,401 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:20,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 145 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-04-08 14:58:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2022-04-08 14:58:20,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:20,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states 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 14:58:20,645 INFO L74 IsIncluded]: Start isIncluded. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states 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 14:58:20,648 INFO L87 Difference]: Start difference. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states 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 14:58:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:20,887 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-08 14:58:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-08 14:58:20,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:20,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:20,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2859 states. [2022-04-08 14:58:20,895 INFO L87 Difference]: Start difference. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2859 states. [2022-04-08 14:58:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:21,101 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-08 14:58:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-08 14:58:21,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:21,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:21,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:21,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states 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 14:58:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2022-04-08 14:58:21,461 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2022-04-08 14:58:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:21,461 INFO L478 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2022-04-08 14:58:21,461 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 14:58:21,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2857 states and 4743 transitions. [2022-04-08 14:58:26,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2022-04-08 14:58:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 14:58:26,238 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:26,238 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, 1] [2022-04-08 14:58:26,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 14:58:26,238 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:26,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 1 times [2022-04-08 14:58:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:26,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460898598] [2022-04-08 14:58:26,239 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 2 times [2022-04-08 14:58:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:26,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117271057] [2022-04-08 14:58:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:26,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:26,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-08 14:58:26,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-08 14:58:26,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-08 14:58:26,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {91707#true} call ULTIMATE.init(); {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:26,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-08 14:58:26,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-08 14:58:26,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-08 14:58:26,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {91707#true} call #t~ret20 := main(); {91707#true} is VALID [2022-04-08 14:58:26,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {91707#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {91707#true} is VALID [2022-04-08 14:58:26,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {91707#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {91707#true} is VALID [2022-04-08 14:58:26,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {91707#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {91707#true} is VALID [2022-04-08 14:58:26,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {91707#true} assume !(0 != ~p1~0); {91707#true} is VALID [2022-04-08 14:58:26,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {91707#true} assume !(0 != ~p2~0); {91707#true} is VALID [2022-04-08 14:58:26,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {91707#true} assume !(0 != ~p3~0); {91707#true} is VALID [2022-04-08 14:58:26,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {91707#true} assume !(0 != ~p4~0); {91707#true} is VALID [2022-04-08 14:58:26,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {91707#true} assume !(0 != ~p5~0); {91707#true} is VALID [2022-04-08 14:58:26,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {91707#true} assume 0 != ~p6~0;~lk6~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:58:26,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {91708#false} is VALID [2022-04-08 14:58:26,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {91708#false} assume 0 != ~p7~0; {91708#false} is VALID [2022-04-08 14:58:26,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {91708#false} assume 1 != ~lk7~0; {91708#false} is VALID [2022-04-08 14:58:26,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {91708#false} assume !false; {91708#false} is VALID [2022-04-08 14:58:26,290 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 14:58:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:26,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117271057] [2022-04-08 14:58:26,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117271057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:26,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:26,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:26,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:26,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460898598] [2022-04-08 14:58:26,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460898598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:26,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:26,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242214639] [2022-04-08 14:58:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:26,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 14:58:26,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:26,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:26,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:26,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:26,312 INFO L87 Difference]: Start difference. First operand 2857 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:27,593 INFO L93 Difference]: Finished difference Result 4285 states and 7097 transitions. [2022-04-08 14:58:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:27,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 14:58:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-08 14:58:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-08 14:58:27,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-08 14:58:27,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:28,070 INFO L225 Difference]: With dead ends: 4285 [2022-04-08 14:58:28,070 INFO L226 Difference]: Without dead ends: 2891 [2022-04-08 14:58:28,072 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 14:58:28,073 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:28,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-04-08 14:58:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2022-04-08 14:58:28,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:28,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states 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 14:58:28,401 INFO L74 IsIncluded]: Start isIncluded. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states 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 14:58:28,403 INFO L87 Difference]: Start difference. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states 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 14:58:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:28,617 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-08 14:58:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-08 14:58:28,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:28,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:28,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2891 states. [2022-04-08 14:58:28,625 INFO L87 Difference]: Start difference. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2891 states. [2022-04-08 14:58:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:28,844 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-08 14:58:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-08 14:58:28,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:28,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:28,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:28,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states 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 14:58:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2022-04-08 14:58:29,193 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2022-04-08 14:58:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:29,194 INFO L478 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2022-04-08 14:58:29,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:29,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2889 states and 4743 transitions. [2022-04-08 14:58:33,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2022-04-08 14:58:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 14:58:33,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:33,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, 1, 1, 1, 1, 1] [2022-04-08 14:58:33,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 14:58:33,994 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 1 times [2022-04-08 14:58:33,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:33,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927078483] [2022-04-08 14:58:33,995 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 2 times [2022-04-08 14:58:33,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:33,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864971523] [2022-04-08 14:58:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:34,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:34,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-08 14:58:34,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-08 14:58:34,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-08 14:58:34,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {111849#true} call ULTIMATE.init(); {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:34,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-08 14:58:34,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-08 14:58:34,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {111849#true} call #t~ret20 := main(); {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {111849#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {111849#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {111849#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {111849#true} assume !(0 != ~p1~0); {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {111849#true} assume !(0 != ~p2~0); {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {111849#true} assume !(0 != ~p3~0); {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {111849#true} assume !(0 != ~p4~0); {111849#true} is VALID [2022-04-08 14:58:34,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {111849#true} assume !(0 != ~p5~0); {111849#true} is VALID [2022-04-08 14:58:34,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {111849#true} assume !(0 != ~p6~0); {111849#true} is VALID [2022-04-08 14:58:34,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {111849#true} assume 0 != ~p7~0;~lk7~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p7~0; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 14:58:34,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {111854#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {111850#false} is VALID [2022-04-08 14:58:34,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {111850#false} assume !false; {111850#false} is VALID [2022-04-08 14:58:34,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 14:58:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864971523] [2022-04-08 14:58:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864971523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:34,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:34,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927078483] [2022-04-08 14:58:34,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927078483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:34,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:34,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000856682] [2022-04-08 14:58:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 14:58:34,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:34,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:34,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:34,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:34,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:34,058 INFO L87 Difference]: Start difference. First operand 2889 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:35,775 INFO L93 Difference]: Finished difference Result 5261 states and 8809 transitions. [2022-04-08 14:58:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:35,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 14:58:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-08 14:58:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-08 14:58:35,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-08 14:58:35,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:36,975 INFO L225 Difference]: With dead ends: 5261 [2022-04-08 14:58:36,975 INFO L226 Difference]: Without dead ends: 5259 [2022-04-08 14:58:36,976 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 14:58:36,976 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:36,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-08 14:58:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2022-04-08 14:58:37,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:37,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states 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 14:58:37,378 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states 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 14:58:37,381 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states 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 14:58:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,150 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-08 14:58:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-08 14:58:38,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:38,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:38,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-08 14:58:38,162 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-08 14:58:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,917 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-08 14:58:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-08 14:58:38,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:38,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:38,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:38,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states 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 14:58:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2022-04-08 14:58:39,714 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2022-04-08 14:58:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:39,714 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2022-04-08 14:58:39,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:39,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 6567 transitions. [2022-04-08 14:58:46,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6567 edges. 6567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2022-04-08 14:58:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 14:58:46,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:46,331 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, 1] [2022-04-08 14:58:46,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 14:58:46,331 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 1 times [2022-04-08 14:58:46,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:46,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17172256] [2022-04-08 14:58:46,332 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 2 times [2022-04-08 14:58:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:46,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492676316] [2022-04-08 14:58:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:46,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:46,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-08 14:58:46,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-08 14:58:46,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-08 14:58:46,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {141111#true} call ULTIMATE.init(); {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:46,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-08 14:58:46,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-08 14:58:46,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-08 14:58:46,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {141111#true} call #t~ret20 := main(); {141111#true} is VALID [2022-04-08 14:58:46,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {141111#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {141111#true} is VALID [2022-04-08 14:58:46,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {141111#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {141111#true} is VALID [2022-04-08 14:58:46,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {141111#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {141111#true} is VALID [2022-04-08 14:58:46,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {141111#true} assume !(0 != ~p1~0); {141111#true} is VALID [2022-04-08 14:58:46,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {141111#true} assume !(0 != ~p2~0); {141111#true} is VALID [2022-04-08 14:58:46,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {141111#true} assume !(0 != ~p3~0); {141111#true} is VALID [2022-04-08 14:58:46,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {141111#true} assume !(0 != ~p4~0); {141111#true} is VALID [2022-04-08 14:58:46,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {141111#true} assume !(0 != ~p5~0); {141111#true} is VALID [2022-04-08 14:58:46,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {141111#true} assume !(0 != ~p6~0); {141111#true} is VALID [2022-04-08 14:58:46,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {141111#true} assume !(0 != ~p7~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p10~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p1~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p2~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p3~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p4~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p5~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p6~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 14:58:46,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p7~0; {141112#false} is VALID [2022-04-08 14:58:46,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {141112#false} assume 1 != ~lk7~0; {141112#false} is VALID [2022-04-08 14:58:46,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {141112#false} assume !false; {141112#false} is VALID [2022-04-08 14:58:46,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 14:58:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:46,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492676316] [2022-04-08 14:58:46,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492676316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:46,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:46,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:46,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:46,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17172256] [2022-04-08 14:58:46,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17172256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:46,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:46,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:46,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742801675] [2022-04-08 14:58:46,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 14:58:46,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:46,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:46,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:46,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:46,393 INFO L87 Difference]: Start difference. First operand 4105 states and 6567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:50,765 INFO L93 Difference]: Finished difference Result 9677 states and 15593 transitions. [2022-04-08 14:58:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:50,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 14:58:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-08 14:58:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-08 14:58:50,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-08 14:58:50,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:52,149 INFO L225 Difference]: With dead ends: 9677 [2022-04-08 14:58:52,150 INFO L226 Difference]: Without dead ends: 5643 [2022-04-08 14:58:52,155 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 14:58:52,155 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:52,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 147 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-08 14:58:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2022-04-08 14:58:52,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:52,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states 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 14:58:52,615 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states 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 14:58:52,619 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states 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 14:58:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:53,443 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-08 14:58:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-08 14:58:53,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:53,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:53,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-08 14:58:53,457 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-08 14:58:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,293 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-08 14:58:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-08 14:58:54,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:54,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:54,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:54,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states 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 14:58:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2022-04-08 14:58:55,665 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2022-04-08 14:58:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:55,666 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2022-04-08 14:58:55,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 9031 transitions. [2022-04-08 14:59:05,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2022-04-08 14:59:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 14:59:05,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:05,231 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, 1, 1] [2022-04-08 14:59:05,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 14:59:05,231 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:05,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 1 times [2022-04-08 14:59:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:05,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716723468] [2022-04-08 14:59:05,232 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 2 times [2022-04-08 14:59:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:05,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436010828] [2022-04-08 14:59:05,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:05,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-08 14:59:05,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-08 14:59:05,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-08 14:59:05,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {183045#true} call ULTIMATE.init(); {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:05,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-08 14:59:05,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-08 14:59:05,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-08 14:59:05,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {183045#true} call #t~ret20 := main(); {183045#true} is VALID [2022-04-08 14:59:05,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {183045#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {183045#true} is VALID [2022-04-08 14:59:05,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {183045#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {183045#true} is VALID [2022-04-08 14:59:05,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {183045#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {183045#true} is VALID [2022-04-08 14:59:05,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {183045#true} assume !(0 != ~p1~0); {183045#true} is VALID [2022-04-08 14:59:05,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {183045#true} assume !(0 != ~p2~0); {183045#true} is VALID [2022-04-08 14:59:05,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {183045#true} assume !(0 != ~p3~0); {183045#true} is VALID [2022-04-08 14:59:05,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {183045#true} assume !(0 != ~p4~0); {183045#true} is VALID [2022-04-08 14:59:05,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {183045#true} assume !(0 != ~p5~0); {183045#true} is VALID [2022-04-08 14:59:05,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {183045#true} assume !(0 != ~p6~0); {183045#true} is VALID [2022-04-08 14:59:05,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {183045#true} assume 0 != ~p7~0;~lk7~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:05,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {183046#false} is VALID [2022-04-08 14:59:05,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {183046#false} assume 0 != ~p8~0; {183046#false} is VALID [2022-04-08 14:59:05,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {183046#false} assume 1 != ~lk8~0; {183046#false} is VALID [2022-04-08 14:59:05,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {183046#false} assume !false; {183046#false} is VALID [2022-04-08 14:59:05,279 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 14:59:05,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:05,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436010828] [2022-04-08 14:59:05,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436010828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:05,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:05,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:05,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:05,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716723468] [2022-04-08 14:59:05,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716723468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:05,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:05,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36176264] [2022-04-08 14:59:05,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 14:59:05,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:05,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:05,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:05,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:05,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:05,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:05,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:05,304 INFO L87 Difference]: Start difference. First operand 5641 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:08,985 INFO L93 Difference]: Finished difference Result 8461 states and 13513 transitions. [2022-04-08 14:59:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 14:59:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-08 14:59:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-08 14:59:08,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-08 14:59:09,150 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 14:59:10,412 INFO L225 Difference]: With dead ends: 8461 [2022-04-08 14:59:10,412 INFO L226 Difference]: Without dead ends: 5707 [2022-04-08 14:59:10,415 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 14:59:10,416 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:10,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:59:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-04-08 14:59:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2022-04-08 14:59:10,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:10,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states 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 14:59:10,943 INFO L74 IsIncluded]: Start isIncluded. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states 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 14:59:10,956 INFO L87 Difference]: Start difference. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states 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 14:59:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:11,802 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-08 14:59:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-08 14:59:11,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:11,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:11,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5707 states. [2022-04-08 14:59:11,825 INFO L87 Difference]: Start difference. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5707 states. [2022-04-08 14:59:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:12,798 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-08 14:59:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-08 14:59:12,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:12,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:12,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:12,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states 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 14:59:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2022-04-08 14:59:14,279 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2022-04-08 14:59:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:14,279 INFO L478 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2022-04-08 14:59:14,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:14,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5705 states and 9031 transitions. [2022-04-08 14:59:23,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2022-04-08 14:59:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 14:59:24,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:24,001 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, 1, 1] [2022-04-08 14:59:24,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 14:59:24,001 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 1 times [2022-04-08 14:59:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:24,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3099125] [2022-04-08 14:59:24,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:24,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 2 times [2022-04-08 14:59:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:24,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987174655] [2022-04-08 14:59:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:24,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:24,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-08 14:59:24,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-08 14:59:24,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-08 14:59:24,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {222803#true} call ULTIMATE.init(); {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:24,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-08 14:59:24,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-08 14:59:24,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-08 14:59:24,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {222803#true} call #t~ret20 := main(); {222803#true} is VALID [2022-04-08 14:59:24,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {222803#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {222803#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {222803#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {222803#true} assume !(0 != ~p1~0); {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {222803#true} assume !(0 != ~p2~0); {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {222803#true} assume !(0 != ~p3~0); {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {222803#true} assume !(0 != ~p4~0); {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {222803#true} assume !(0 != ~p5~0); {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {222803#true} assume !(0 != ~p6~0); {222803#true} is VALID [2022-04-08 14:59:24,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {222803#true} assume !(0 != ~p7~0); {222803#true} is VALID [2022-04-08 14:59:24,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {222803#true} assume 0 != ~p8~0;~lk8~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p8~0; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:24,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {222808#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {222804#false} is VALID [2022-04-08 14:59:24,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {222804#false} assume !false; {222804#false} is VALID [2022-04-08 14:59:24,056 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 14:59:24,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:24,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987174655] [2022-04-08 14:59:24,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987174655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:24,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:24,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:24,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:24,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3099125] [2022-04-08 14:59:24,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3099125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:24,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:24,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:24,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025505729] [2022-04-08 14:59:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:24,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 14:59:24,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:24,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:24,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:24,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:24,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:24,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:24,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:24,080 INFO L87 Difference]: Start difference. First operand 5705 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:29,760 INFO L93 Difference]: Finished difference Result 10253 states and 16585 transitions. [2022-04-08 14:59:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 14:59:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 14:59:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 14:59:29,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 14:59:29,872 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 14:59:34,120 INFO L225 Difference]: With dead ends: 10253 [2022-04-08 14:59:34,120 INFO L226 Difference]: Without dead ends: 10251 [2022-04-08 14:59:34,122 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 14:59:34,122 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:34,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 101 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:59:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2022-04-08 14:59:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2022-04-08 14:59:34,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:34,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states 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 14:59:34,840 INFO L74 IsIncluded]: Start isIncluded. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states 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 14:59:34,850 INFO L87 Difference]: Start difference. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states 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 14:59:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:38,166 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-08 14:59:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-08 14:59:38,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:38,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:38,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10251 states. [2022-04-08 14:59:38,202 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10251 states. [2022-04-08 14:59:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:41,141 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-08 14:59:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-08 14:59:41,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:41,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:41,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:41,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states 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 14:59:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2022-04-08 14:59:44,380 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2022-04-08 14:59:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:44,380 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2022-04-08 14:59:44,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:44,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 12615 transitions. [2022-04-08 14:59:57,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12615 edges. 12615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2022-04-08 14:59:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 14:59:57,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:57,844 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, 1, 1] [2022-04-08 14:59:57,844 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 14:59:57,844 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:57,844 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 1 times [2022-04-08 14:59:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:57,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [156397836] [2022-04-08 14:59:57,845 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 2 times [2022-04-08 14:59:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:57,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072083102] [2022-04-08 14:59:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:57,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:57,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-08 14:59:57,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-08 14:59:57,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-08 14:59:57,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {280225#true} call ULTIMATE.init(); {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:57,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {280225#true} call #t~ret20 := main(); {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {280225#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {280225#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {280225#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {280225#true} assume !(0 != ~p1~0); {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {280225#true} assume !(0 != ~p2~0); {280225#true} is VALID [2022-04-08 14:59:57,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {280225#true} assume !(0 != ~p3~0); {280225#true} is VALID [2022-04-08 14:59:57,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {280225#true} assume !(0 != ~p4~0); {280225#true} is VALID [2022-04-08 14:59:57,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {280225#true} assume !(0 != ~p5~0); {280225#true} is VALID [2022-04-08 14:59:57,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {280225#true} assume !(0 != ~p6~0); {280225#true} is VALID [2022-04-08 14:59:57,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {280225#true} assume !(0 != ~p7~0); {280225#true} is VALID [2022-04-08 14:59:57,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {280225#true} assume !(0 != ~p8~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p10~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p1~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p2~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p3~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p4~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p5~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p6~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p7~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:57,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p8~0; {280226#false} is VALID [2022-04-08 14:59:57,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {280226#false} assume 1 != ~lk8~0; {280226#false} is VALID [2022-04-08 14:59:57,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {280226#false} assume !false; {280226#false} is VALID [2022-04-08 14:59:57,910 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 14:59:57,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:57,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072083102] [2022-04-08 14:59:57,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072083102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:57,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:57,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:57,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:57,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [156397836] [2022-04-08 14:59:57,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [156397836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:57,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:57,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612232394] [2022-04-08 14:59:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 14:59:57,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:57,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:57,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:57,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:57,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:57,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:57,941 INFO L87 Difference]: Start difference. First operand 8201 states and 12615 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:00:15,635 INFO L93 Difference]: Finished difference Result 19213 states and 29769 transitions. [2022-04-08 15:00:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:00:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 15:00:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:00:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-08 15:00:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-08 15:00:15,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 261 transitions. [2022-04-08 15:00:15,801 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 15:00:20,930 INFO L225 Difference]: With dead ends: 19213 [2022-04-08 15:00:20,931 INFO L226 Difference]: Without dead ends: 11147 [2022-04-08 15:00:20,939 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 15:00:20,940 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:00:20,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 15:00:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2022-04-08 15:00:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2022-04-08 15:00:21,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:00:21,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states 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 15:00:21,911 INFO L74 IsIncluded]: Start isIncluded. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states 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 15:00:21,921 INFO L87 Difference]: Start difference. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states 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 15:00:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:00:25,294 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-08 15:00:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-08 15:00:25,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:00:25,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:00:25,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11147 states. [2022-04-08 15:00:25,337 INFO L87 Difference]: Start difference. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11147 states. [2022-04-08 15:00:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:00:28,813 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-08 15:00:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-08 15:00:28,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:00:28,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:00:28,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:00:28,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:00:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states 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 15:00:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2022-04-08 15:00:34,119 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2022-04-08 15:00:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:00:34,120 INFO L478 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2022-04-08 15:00:34,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:34,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11145 states and 17159 transitions. [2022-04-08 15:00:53,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:00:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2022-04-08 15:00:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 15:00:53,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:00:53,700 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, 1, 1, 1] [2022-04-08 15:00:53,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 15:00:53,700 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:00:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:00:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 1 times [2022-04-08 15:00:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:00:53,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409471583] [2022-04-08 15:00:53,701 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:00:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 2 times [2022-04-08 15:00:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:00:53,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532415490] [2022-04-08 15:00:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:00:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:00:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:53,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:00:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:53,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-08 15:00:53,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-08 15:00:53,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-08 15:00:53,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {363247#true} call ULTIMATE.init(); {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:00:53,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-08 15:00:53,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {363247#true} call #t~ret20 := main(); {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {363247#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {363247#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {363247#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {363247#true} assume !(0 != ~p1~0); {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {363247#true} assume !(0 != ~p2~0); {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {363247#true} assume !(0 != ~p3~0); {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {363247#true} assume !(0 != ~p4~0); {363247#true} is VALID [2022-04-08 15:00:53,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {363247#true} assume !(0 != ~p5~0); {363247#true} is VALID [2022-04-08 15:00:53,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {363247#true} assume !(0 != ~p6~0); {363247#true} is VALID [2022-04-08 15:00:53,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {363247#true} assume !(0 != ~p7~0); {363247#true} is VALID [2022-04-08 15:00:53,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {363247#true} assume 0 != ~p8~0;~lk8~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 15:00:53,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {363248#false} is VALID [2022-04-08 15:00:53,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {363248#false} assume 0 != ~p9~0; {363248#false} is VALID [2022-04-08 15:00:53,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {363248#false} assume 1 != ~lk9~0; {363248#false} is VALID [2022-04-08 15:00:53,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {363248#false} assume !false; {363248#false} is VALID [2022-04-08 15:00:53,746 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 15:00:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:00:53,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532415490] [2022-04-08 15:00:53,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532415490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:00:53,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:00:53,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:00:53,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:00:53,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409471583] [2022-04-08 15:00:53,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409471583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:00:53,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:00:53,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:00:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162538228] [2022-04-08 15:00:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:00:53,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 15:00:53,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:00:53,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:53,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:00:53,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:00:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:00:53,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:00:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:00:53,769 INFO L87 Difference]: Start difference. First operand 11145 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:07,364 INFO L93 Difference]: Finished difference Result 16717 states and 25673 transitions. [2022-04-08 15:01:07,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:01:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 15:01:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:01:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-08 15:01:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-08 15:01:07,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 256 transitions. [2022-04-08 15:01:07,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:01:12,730 INFO L225 Difference]: With dead ends: 16717 [2022-04-08 15:01:12,730 INFO L226 Difference]: Without dead ends: 11275 [2022-04-08 15:01:12,738 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 15:01:12,738 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:01:12,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 15:01:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2022-04-08 15:01:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2022-04-08 15:01:13,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:01:13,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states 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 15:01:13,773 INFO L74 IsIncluded]: Start isIncluded. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states 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 15:01:13,786 INFO L87 Difference]: Start difference. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states 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 15:01:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:17,201 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-08 15:01:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-08 15:01:17,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:01:17,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:01:17,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11275 states. [2022-04-08 15:01:17,234 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11275 states. [2022-04-08 15:01:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:20,781 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-08 15:01:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-08 15:01:20,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:01:20,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:01:20,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:01:20,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:01:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states 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 15:01:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2022-04-08 15:01:26,649 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2022-04-08 15:01:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:01:26,649 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2022-04-08 15:01:26,649 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:26,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 17159 transitions. [2022-04-08 15:01:46,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:01:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2022-04-08 15:01:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 15:01:46,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:01:46,160 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, 1, 1, 1] [2022-04-08 15:01:46,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 15:01:46,161 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:01:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:01:46,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 1 times [2022-04-08 15:01:46,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:01:46,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054535586] [2022-04-08 15:01:46,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:01:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 2 times [2022-04-08 15:01:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:01:46,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886710366] [2022-04-08 15:01:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:01:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:01:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:01:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:01:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:01:46,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-08 15:01:46,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-08 15:01:46,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-08 15:01:46,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {441789#true} call ULTIMATE.init(); {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:01:46,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {441789#true} call #t~ret20 := main(); {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {441789#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {441789#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {441789#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {441789#true} assume !(0 != ~p1~0); {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {441789#true} assume !(0 != ~p2~0); {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {441789#true} assume !(0 != ~p3~0); {441789#true} is VALID [2022-04-08 15:01:46,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {441789#true} assume !(0 != ~p4~0); {441789#true} is VALID [2022-04-08 15:01:46,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {441789#true} assume !(0 != ~p5~0); {441789#true} is VALID [2022-04-08 15:01:46,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {441789#true} assume !(0 != ~p6~0); {441789#true} is VALID [2022-04-08 15:01:46,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {441789#true} assume !(0 != ~p7~0); {441789#true} is VALID [2022-04-08 15:01:46,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {441789#true} assume !(0 != ~p8~0); {441789#true} is VALID [2022-04-08 15:01:46,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {441789#true} assume 0 != ~p9~0;~lk9~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p9~0; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 15:01:46,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {441794#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {441790#false} is VALID [2022-04-08 15:01:46,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {441790#false} assume !false; {441790#false} is VALID [2022-04-08 15:01:46,211 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 15:01:46,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:01:46,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886710366] [2022-04-08 15:01:46,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886710366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:01:46,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:01:46,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:01:46,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:01:46,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054535586] [2022-04-08 15:01:46,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054535586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:01:46,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:01:46,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:01:46,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693402614] [2022-04-08 15:01:46,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:01:46,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 15:01:46,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:01:46,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:46,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:01:46,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:01:46,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:01:46,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:01:46,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:01:46,236 INFO L87 Difference]: Start difference. First operand 11273 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:02:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:02:05,425 INFO L93 Difference]: Finished difference Result 19981 states and 31113 transitions. [2022-04-08 15:02:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:02:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 15:02:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:02:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:02:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 15:02:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:02:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 15:02:05,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-08 15:02:05,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:02:21,752 INFO L225 Difference]: With dead ends: 19981 [2022-04-08 15:02:21,752 INFO L226 Difference]: Without dead ends: 19979 [2022-04-08 15:02:21,756 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 15:02:21,757 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:02:21,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 15:02:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2022-04-08 15:02:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2022-04-08 15:02:23,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:02:23,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states 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 15:02:23,216 INFO L74 IsIncluded]: Start isIncluded. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states 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 15:02:23,238 INFO L87 Difference]: Start difference. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states 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 15:02:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:02:33,512 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-08 15:02:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-08 15:02:33,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:02:33,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:02:33,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19979 states. [2022-04-08 15:02:33,566 INFO L87 Difference]: Start difference. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19979 states. [2022-04-08 15:02:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:02:43,819 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-08 15:02:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-08 15:02:43,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:02:43,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:02:43,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:02:43,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:02:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states 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 15:02:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2022-04-08 15:02:56,110 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2022-04-08 15:02:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:02:56,110 INFO L478 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2022-04-08 15:02:56,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:02:56,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16393 states and 24199 transitions. [2022-04-08 15:03:23,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24199 edges. 24199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:03:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2022-04-08 15:03:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 15:03:23,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:03:23,129 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, 1, 1, 1] [2022-04-08 15:03:23,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 15:03:23,130 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:03:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:03:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 1 times [2022-04-08 15:03:23,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:03:23,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401979077] [2022-04-08 15:03:23,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:03:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 2 times [2022-04-08 15:03:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:03:23,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622583312] [2022-04-08 15:03:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:03:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:03:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:03:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:03:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:03:23,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-08 15:03:23,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-08 15:03:23,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-08 15:03:23,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {554507#true} call ULTIMATE.init(); {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:03:23,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-08 15:03:23,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-08 15:03:23,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-08 15:03:23,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {554507#true} call #t~ret20 := main(); {554507#true} is VALID [2022-04-08 15:03:23,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {554507#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {554507#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {554507#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {554507#true} assume !(0 != ~p1~0); {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {554507#true} assume !(0 != ~p2~0); {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {554507#true} assume !(0 != ~p3~0); {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {554507#true} assume !(0 != ~p4~0); {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {554507#true} assume !(0 != ~p5~0); {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {554507#true} assume !(0 != ~p6~0); {554507#true} is VALID [2022-04-08 15:03:23,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {554507#true} assume !(0 != ~p7~0); {554507#true} is VALID [2022-04-08 15:03:23,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {554507#true} assume !(0 != ~p8~0); {554507#true} is VALID [2022-04-08 15:03:23,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {554507#true} assume !(0 != ~p9~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p10~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p1~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p2~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p3~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p4~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p5~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p6~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p7~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p8~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 15:03:23,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p9~0; {554508#false} is VALID [2022-04-08 15:03:23,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {554508#false} assume 1 != ~lk9~0; {554508#false} is VALID [2022-04-08 15:03:23,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {554508#false} assume !false; {554508#false} is VALID [2022-04-08 15:03:23,182 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 15:03:23,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:03:23,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622583312] [2022-04-08 15:03:23,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622583312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:03:23,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:03:23,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:03:23,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:03:23,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401979077] [2022-04-08 15:03:23,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401979077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:03:23,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:03:23,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:03:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129313939] [2022-04-08 15:03:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:03:23,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 15:03:23,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:03:23,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:03:23,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:03:23,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:03:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:03:23,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:03:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:03:23,205 INFO L87 Difference]: Start difference. First operand 16393 states and 24199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:06:17,350 INFO L93 Difference]: Finished difference Result 38157 states and 56713 transitions. [2022-04-08 15:06:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:06:17,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-08 15:06:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:06:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-08 15:06:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-08 15:06:17,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-08 15:06:17,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:06:37,356 INFO L225 Difference]: With dead ends: 38157 [2022-04-08 15:06:37,357 INFO L226 Difference]: Without dead ends: 22027 [2022-04-08 15:06:37,378 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 15:06:37,379 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:06:37,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 151 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 15:06:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2022-04-08 15:06:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2022-04-08 15:06:39,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:06:39,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states 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 15:06:39,469 INFO L74 IsIncluded]: Start isIncluded. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states 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 15:06:39,497 INFO L87 Difference]: Start difference. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states 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 15:06:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:06:53,994 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-08 15:06:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-08 15:06:54,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:06:54,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:06:54,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22027 states. [2022-04-08 15:06:54,068 INFO L87 Difference]: Start difference. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22027 states. [2022-04-08 15:07:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:07:08,688 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-08 15:07:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-08 15:07:08,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:07:08,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:07:08,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:07:08,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:07:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states 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 15:07:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2022-04-08 15:07:30,877 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2022-04-08 15:07:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:07:30,878 INFO L478 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2022-04-08 15:07:30,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:07:30,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22025 states and 32519 transitions. [2022-04-08 15:08:09,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32519 edges. 32519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:08:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2022-04-08 15:08:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 15:08:09,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:08:09,493 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, 1, 1, 1, 1] [2022-04-08 15:08:09,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 15:08:09,493 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:08:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:08:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 1 times [2022-04-08 15:08:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:08:09,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460370706] [2022-04-08 15:08:09,494 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:08:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 2 times [2022-04-08 15:08:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:08:09,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109658303] [2022-04-08 15:08:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:08:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:08:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:08:09,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:08:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:08:09,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-08 15:08:09,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-08 15:08:09,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-08 15:08:09,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {718937#true} call ULTIMATE.init(); {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:08:09,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {718937#true} call #t~ret20 := main(); {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {718937#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {718937#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {718937#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {718937#true} assume !(0 != ~p1~0); {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {718937#true} assume !(0 != ~p2~0); {718937#true} is VALID [2022-04-08 15:08:09,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {718937#true} assume !(0 != ~p3~0); {718937#true} is VALID [2022-04-08 15:08:09,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {718937#true} assume !(0 != ~p4~0); {718937#true} is VALID [2022-04-08 15:08:09,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {718937#true} assume !(0 != ~p5~0); {718937#true} is VALID [2022-04-08 15:08:09,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {718937#true} assume !(0 != ~p6~0); {718937#true} is VALID [2022-04-08 15:08:09,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {718937#true} assume !(0 != ~p7~0); {718937#true} is VALID [2022-04-08 15:08:09,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {718937#true} assume !(0 != ~p8~0); {718937#true} is VALID [2022-04-08 15:08:09,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {718937#true} assume 0 != ~p9~0;~lk9~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:08:09,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {718938#false} is VALID [2022-04-08 15:08:09,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {718938#false} assume 0 != ~p10~0; {718938#false} is VALID [2022-04-08 15:08:09,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {718938#false} assume 1 != ~lk10~0; {718938#false} is VALID [2022-04-08 15:08:09,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {718938#false} assume !false; {718938#false} is VALID [2022-04-08 15:08:09,536 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 15:08:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:08:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109658303] [2022-04-08 15:08:09,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109658303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:08:09,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:08:09,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:08:09,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:08:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460370706] [2022-04-08 15:08:09,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460370706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:08:09,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:08:09,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:08:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713815596] [2022-04-08 15:08:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:08:09,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 15:08:09,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:08:09,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states 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 15:08:09,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:08:09,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:08:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:08:09,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:08:09,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:08:09,560 INFO L87 Difference]: Start difference. First operand 22025 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states 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 15:09:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:09:36,915 INFO L93 Difference]: Finished difference Result 33037 states and 48649 transitions. [2022-04-08 15:09:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:09:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-08 15:09:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:09:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states 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 15:09:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-08 15:09:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states 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 15:09:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-08 15:09:36,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-08 15:09:37,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:09:56,899 INFO L225 Difference]: With dead ends: 33037 [2022-04-08 15:09:56,900 INFO L226 Difference]: Without dead ends: 22283 [2022-04-08 15:09:56,914 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 15:09:56,915 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:09:56,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 139 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 15:09:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2022-04-08 15:09:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2022-04-08 15:09:59,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:09:59,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states 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 15:09:59,091 INFO L74 IsIncluded]: Start isIncluded. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states 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 15:09:59,118 INFO L87 Difference]: Start difference. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states 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 15:10:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:12,056 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-08 15:10:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-08 15:10:12,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:12,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:12,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22283 states. [2022-04-08 15:10:12,123 INFO L87 Difference]: Start difference. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22283 states. [2022-04-08 15:10:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:26,139 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-08 15:10:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-08 15:10:26,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:26,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:26,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:26,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states 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 15:10:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 32519 transitions. [2022-04-08 15:10:48,599 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 32519 transitions. Word has length 35 [2022-04-08 15:10:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:48,600 INFO L478 AbstractCegarLoop]: Abstraction has 22281 states and 32519 transitions. [2022-04-08 15:10:48,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states 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 15:10:48,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22281 states and 32519 transitions.