/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:58:34,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:58:34,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:58:34,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:58:34,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:58:34,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:58:34,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:58:34,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:58:34,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:58:34,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:58:34,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:58:34,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:58:34,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:58:34,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:58:34,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:58:34,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:58:34,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:58:34,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:58:34,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:58:34,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:58:34,869 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:58:34,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:58:34,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:58:34,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:58:34,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:58:34,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:58:34,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:58:34,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:58:34,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:58:34,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:58:34,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:58:34,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:58:34,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:58:34,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:58:34,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:58:34,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:58:34,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:58:34,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:58:34,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:58:34,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:58:34,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:58:34,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:58:34,881 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:58:34,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:58:34,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:58:34,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:58:34,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:58:34,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:58:34,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:58:34,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:58:34,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:58:34,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:58:34,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:58:34,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:58:34,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:58:34,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:58:34,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:58:34,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:58:34,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:58:34,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:58:34,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:58:34,890 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:58:34,890 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:58:34,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:58:34,891 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:58:34,891 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:58:35,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:58:35,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:58:35,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:58:35,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:58:35,077 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:58:35,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-08 14:58:35,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f759ed2/0e7915e71db543c5b341f97642b7dbc9/FLAGf1785a218 [2022-04-08 14:58:35,522 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:58:35,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-08 14:58:35,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f759ed2/0e7915e71db543c5b341f97642b7dbc9/FLAGf1785a218 [2022-04-08 14:58:35,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f759ed2/0e7915e71db543c5b341f97642b7dbc9 [2022-04-08 14:58:35,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:58:35,950 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:58:35,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:58:35,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:58:35,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:58:35,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:58:35" (1/1) ... [2022-04-08 14:58:35,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d22f877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:35, skipping insertion in model container [2022-04-08 14:58:35,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:58:35" (1/1) ... [2022-04-08 14:58:35,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:58:35,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:58:36,195 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_6.c[2544,2557] [2022-04-08 14:58:36,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:58:36,203 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:58:36,215 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_6.c[2544,2557] [2022-04-08 14:58:36,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:58:36,226 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:58:36,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36 WrapperNode [2022-04-08 14:58:36,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:58:36,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:58:36,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:58:36,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:58:36,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (1/1) ... [2022-04-08 14:58:36,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (1/1) ... [2022-04-08 14:58:36,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (1/1) ... [2022-04-08 14:58:36,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (1/1) ... [2022-04-08 14:58:36,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (1/1) ... [2022-04-08 14:58:36,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (1/1) ... [2022-04-08 14:58:36,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (1/1) ... [2022-04-08 14:58:36,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:58:36,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:58:36,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:58:36,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:58:36,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (1/1) ... [2022-04-08 14:58:36,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:58:36,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:58:36,285 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:58:36,310 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:58:36,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:58:36,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:58:36,319 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:58:36,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:58:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:58:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:58:36,364 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:58:36,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:58:36,484 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:58:36,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:58:36,488 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:58:36,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:58:36 BoogieIcfgContainer [2022-04-08 14:58:36,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:58:36,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:58:36,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:58:36,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:58:36,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:58:35" (1/3) ... [2022-04-08 14:58:36,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24187393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:58:36, skipping insertion in model container [2022-04-08 14:58:36,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:36" (2/3) ... [2022-04-08 14:58:36,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24187393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:58:36, skipping insertion in model container [2022-04-08 14:58:36,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:58:36" (3/3) ... [2022-04-08 14:58:36,495 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-04-08 14:58:36,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:58:36,498 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:58:36,523 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:58:36,527 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:58:36,527 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:58:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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:58:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:58:36,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:36,543 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:36,543 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-04-08 14:58:36,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:36,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833145444] [2022-04-08 14:58:36,558 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 2 times [2022-04-08 14:58:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:36,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677522891] [2022-04-08 14:58:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:36,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-08 14:58:36,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 14:58:36,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-08 14:58:36,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:36,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-08 14:58:36,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 14:58:36,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-08 14:58:36,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2022-04-08 14:58:36,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#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;havoc ~cond~0; {36#true} is VALID [2022-04-08 14:58:36,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {36#true} is VALID [2022-04-08 14:58:36,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {36#true} is VALID [2022-04-08 14:58:36,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 != ~p1~0;~lk1~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:36,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {41#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:36,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:36,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:36,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:36,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:36,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p1~0; {41#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:36,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {37#false} is VALID [2022-04-08 14:58:36,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-08 14:58:36,762 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:36,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:36,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677522891] [2022-04-08 14:58:36,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677522891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:36,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:36,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:36,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:36,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833145444] [2022-04-08 14:58:36,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833145444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:36,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:36,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429038081] [2022-04-08 14:58:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:36,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 14:58:36,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:36,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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:36,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:36,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:36,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:36,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:36,824 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,078 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-04-08 14:58:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:37,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 14:58:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 14:58:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 14:58:37,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 14:58:37,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:37,183 INFO L225 Difference]: With dead ends: 64 [2022-04-08 14:58:37,183 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 14:58:37,186 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:37,189 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:37,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 14:58:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-08 14:58:37,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:37,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have 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,211 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have 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,211 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have 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,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,217 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-08 14:58:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-08 14:58:37,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:37,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:37,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 14:58:37,219 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 14:58:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,224 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-08 14:58:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-08 14:58:37,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:37,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:37,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:37,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have 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,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-08 14:58:37,228 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-08 14:58:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:37,229 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-08 14:58:37,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 58 transitions. [2022-04-08 14:58:37,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-08 14:58:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:58:37,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:37,308 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:37,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:58:37,308 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-04-08 14:58:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:37,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1717024588] [2022-04-08 14:58:37,310 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 2 times [2022-04-08 14:58:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:37,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899477071] [2022-04-08 14:58:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:37,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {344#true} is VALID [2022-04-08 14:58:37,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-08 14:58:37,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-08 14:58:37,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:37,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {344#true} is VALID [2022-04-08 14:58:37,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-08 14:58:37,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-08 14:58:37,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret11 := main(); {344#true} is VALID [2022-04-08 14:58:37,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#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;havoc ~cond~0; {344#true} is VALID [2022-04-08 14:58:37,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {344#true} is VALID [2022-04-08 14:58:37,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {344#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {344#true} is VALID [2022-04-08 14:58:37,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#true} assume !(0 != ~p1~0); {349#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:37,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= main_~p1~0 0)} assume !(0 != ~p2~0); {349#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:37,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:37,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:37,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:37,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:37,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p1~0; {345#false} is VALID [2022-04-08 14:58:37,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {345#false} assume 1 != ~lk1~0; {345#false} is VALID [2022-04-08 14:58:37,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-04-08 14:58:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899477071] [2022-04-08 14:58:37,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899477071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:37,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:37,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:37,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1717024588] [2022-04-08 14:58:37,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1717024588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:37,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:37,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:37,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378488342] [2022-04-08 14:58:37,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:37,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 14:58:37,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:37,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:37,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:37,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:37,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:37,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:37,411 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,537 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-04-08 14:58:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:37,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 14:58:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-08 14:58:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-08 14:58:37,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-04-08 14:58:37,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:37,619 INFO L225 Difference]: With dead ends: 78 [2022-04-08 14:58:37,620 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 14:58:37,620 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:37,621 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:37,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 14:58:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-08 14:58:37,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:37,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have 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,628 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have 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,628 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have 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,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,631 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-08 14:58:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-08 14:58:37,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:37,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:37,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 14:58:37,632 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 14:58:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,634 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-08 14:58:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-08 14:58:37,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:37,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:37,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:37,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have 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,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-08 14:58:37,636 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-08 14:58:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:37,636 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-08 14:58:37,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have 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,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 78 transitions. [2022-04-08 14:58:37,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-08 14:58:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:58:37,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:37,699 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:37,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:58:37,699 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:37,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-04-08 14:58:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:37,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [822308674] [2022-04-08 14:58:37,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:37,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 2 times [2022-04-08 14:58:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:37,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403295457] [2022-04-08 14:58:37,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:37,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:37,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-08 14:58:37,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-08 14:58:37,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-08 14:58:37,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:37,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-08 14:58:37,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-08 14:58:37,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-08 14:58:37,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret11 := main(); {704#true} is VALID [2022-04-08 14:58:37,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#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;havoc ~cond~0; {704#true} is VALID [2022-04-08 14:58:37,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {704#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {704#true} is VALID [2022-04-08 14:58:37,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {704#true} is VALID [2022-04-08 14:58:37,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#true} assume 0 != ~p1~0;~lk1~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:37,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {709#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:37,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:37,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:37,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:37,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:37,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {705#false} is VALID [2022-04-08 14:58:37,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {705#false} assume 0 != ~p2~0; {705#false} is VALID [2022-04-08 14:58:37,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} assume 1 != ~lk2~0; {705#false} is VALID [2022-04-08 14:58:37,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-08 14:58:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403295457] [2022-04-08 14:58:37,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403295457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:37,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:37,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:37,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [822308674] [2022-04-08 14:58:37,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [822308674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:37,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:37,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:37,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165732677] [2022-04-08 14:58:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 14:58:37,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:37,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:37,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:37,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:37,756 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,860 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-08 14:58:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:37,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 14:58:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:58:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:58:37,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 14:58:37,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:37,931 INFO L225 Difference]: With dead ends: 73 [2022-04-08 14:58:37,931 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 14:58:37,932 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:37,933 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:37,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 14:58:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-08 14:58:37,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:37,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have 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,939 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have 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,939 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have 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,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,940 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-08 14:58:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-08 14:58:37,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:37,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:37,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-08 14:58:37,941 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-08 14:58:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,943 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-08 14:58:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-08 14:58:37,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:37,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:37,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:37,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have 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,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-08 14:58:37,945 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-08 14:58:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:37,945 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-08 14:58:37,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 80 transitions. [2022-04-08 14:58:38,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-08 14:58:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:58:38,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:38,001 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:38,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:58:38,001 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:38,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-04-08 14:58:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:38,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1665896795] [2022-04-08 14:58:38,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:38,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 2 times [2022-04-08 14:58:38,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:38,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940195859] [2022-04-08 14:58:38,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:38,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1066#true} is VALID [2022-04-08 14:58:38,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-08 14:58:38,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-08 14:58:38,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:38,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1066#true} is VALID [2022-04-08 14:58:38,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-08 14:58:38,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-08 14:58:38,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret11 := main(); {1066#true} is VALID [2022-04-08 14:58:38,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#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;havoc ~cond~0; {1066#true} is VALID [2022-04-08 14:58:38,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1066#true} is VALID [2022-04-08 14:58:38,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1066#true} is VALID [2022-04-08 14:58:38,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 != ~p1~0); {1066#true} is VALID [2022-04-08 14:58:38,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume !(0 != ~p2~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:38,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:38,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:38,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:38,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:38,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:38,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p2~0; {1067#false} is VALID [2022-04-08 14:58:38,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#false} assume 1 != ~lk2~0; {1067#false} is VALID [2022-04-08 14:58:38,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-08 14:58:38,042 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:38,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:38,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940195859] [2022-04-08 14:58:38,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940195859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:38,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:38,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:38,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:38,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1665896795] [2022-04-08 14:58:38,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1665896795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:38,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:38,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:38,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367191616] [2022-04-08 14:58:38,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 14:58:38,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:38,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:38,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:38,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:38,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:38,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:38,055 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,148 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-04-08 14:58:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 14:58:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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 L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 14:58:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 14:58:38,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-08 14:58:38,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:38,220 INFO L225 Difference]: With dead ends: 130 [2022-04-08 14:58:38,220 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 14:58:38,220 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:38,221 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:38,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 14:58:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-08 14:58:38,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:38,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have 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,230 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have 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,230 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have 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,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,232 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-08 14:58:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-08 14:58:38,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:38,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:38,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-08 14:58:38,233 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-08 14:58:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,236 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-08 14:58:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-08 14:58:38,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:38,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:38,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:38,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have 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,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-04-08 14:58:38,239 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-04-08 14:58:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:38,239 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-04-08 14:58:38,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 141 transitions. [2022-04-08 14:58:38,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-04-08 14:58:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:58:38,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:38,363 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:38,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:58:38,364 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-04-08 14:58:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:38,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [232256889] [2022-04-08 14:58:38,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 2 times [2022-04-08 14:58:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:38,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446629048] [2022-04-08 14:58:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:38,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1690#true} is VALID [2022-04-08 14:58:38,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-08 14:58:38,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-08 14:58:38,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1690#true} call ULTIMATE.init(); {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:38,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1690#true} is VALID [2022-04-08 14:58:38,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-08 14:58:38,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-08 14:58:38,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {1690#true} call #t~ret11 := main(); {1690#true} is VALID [2022-04-08 14:58:38,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {1690#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;havoc ~cond~0; {1690#true} is VALID [2022-04-08 14:58:38,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {1690#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1690#true} is VALID [2022-04-08 14:58:38,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1690#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1690#true} is VALID [2022-04-08 14:58:38,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#true} assume !(0 != ~p1~0); {1690#true} is VALID [2022-04-08 14:58:38,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#true} assume 0 != ~p2~0;~lk2~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:38,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:38,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:38,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:38,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:38,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {1695#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1695#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:38,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1695#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:38,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1691#false} is VALID [2022-04-08 14:58:38,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2022-04-08 14:58:38,401 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:38,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:38,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446629048] [2022-04-08 14:58:38,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446629048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:38,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:38,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:38,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [232256889] [2022-04-08 14:58:38,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [232256889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:38,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:38,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:38,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92594965] [2022-04-08 14:58:38,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:38,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 14:58:38,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:38,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:38,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:38,413 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,508 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-04-08 14:58:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:38,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 14:58:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-08 14:58:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-08 14:58:38,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-04-08 14:58:38,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:38,571 INFO L225 Difference]: With dead ends: 111 [2022-04-08 14:58:38,571 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 14:58:38,572 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:38,572 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:38,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 14:58:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-04-08 14:58:38,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:38,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have 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,584 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have 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,584 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have 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,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,587 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-08 14:58:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-08 14:58:38,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:38,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:38,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-08 14:58:38,587 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-08 14:58:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,590 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-08 14:58:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-08 14:58:38,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:38,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:38,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:38,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have 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,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-08 14:58:38,594 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-08 14:58:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:38,594 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-08 14:58:38,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have 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,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 139 transitions. [2022-04-08 14:58:38,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-08 14:58:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 14:58:38,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:38,732 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:38,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:58:38,733 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-04-08 14:58:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:38,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575400441] [2022-04-08 14:58:38,734 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:38,734 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 2 times [2022-04-08 14:58:38,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:38,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089492784] [2022-04-08 14:58:38,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:38,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:38,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {2322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2316#true} is VALID [2022-04-08 14:58:38,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-08 14:58:38,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-08 14:58:38,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {2316#true} call ULTIMATE.init(); {2322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:38,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2316#true} is VALID [2022-04-08 14:58:38,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-08 14:58:38,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-08 14:58:38,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} call #t~ret11 := main(); {2316#true} is VALID [2022-04-08 14:58:38,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#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;havoc ~cond~0; {2316#true} is VALID [2022-04-08 14:58:38,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {2316#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2316#true} is VALID [2022-04-08 14:58:38,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {2316#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {2316#true} is VALID [2022-04-08 14:58:38,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {2316#true} assume !(0 != ~p1~0); {2316#true} is VALID [2022-04-08 14:58:38,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2316#true} assume !(0 != ~p2~0); {2316#true} is VALID [2022-04-08 14:58:38,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {2316#true} assume 0 != ~p3~0;~lk3~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:38,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:38,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:38,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:38,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {2321#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2321#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:38,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2321#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:38,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2321#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:38,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2317#false} is VALID [2022-04-08 14:58:38,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {2317#false} assume !false; {2317#false} is VALID [2022-04-08 14:58:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:38,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089492784] [2022-04-08 14:58:38,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089492784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:38,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:38,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:38,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:38,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575400441] [2022-04-08 14:58:38,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575400441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:38,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:38,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806014402] [2022-04-08 14:58:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:38,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 14:58:38,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:38,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:38,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:38,835 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:38,943 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-04-08 14:58:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:38,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 14:58:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-08 14:58:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-08 14:58:38,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-08 14:58:38,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:39,004 INFO L225 Difference]: With dead ends: 155 [2022-04-08 14:58:39,004 INFO L226 Difference]: Without dead ends: 153 [2022-04-08 14:58:39,004 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:39,006 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:39,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-08 14:58:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-04-08 14:58:39,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:39,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have 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,035 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have 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,036 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have 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,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,040 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-08 14:58:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-08 14:58:39,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:39,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:39,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-08 14:58:39,042 INFO L87 Difference]: Start difference. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-08 14:58:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,047 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-08 14:58:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-08 14:58:39,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:39,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:39,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:39,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have 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,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-04-08 14:58:39,052 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-04-08 14:58:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:39,052 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-04-08 14:58:39,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 189 transitions. [2022-04-08 14:58:39,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-04-08 14:58:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 14:58:39,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:39,214 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:39,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:58:39,214 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-04-08 14:58:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:39,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [823500883] [2022-04-08 14:58:39,215 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 2 times [2022-04-08 14:58:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:39,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77249910] [2022-04-08 14:58:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:39,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3182#true} is VALID [2022-04-08 14:58:39,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-08 14:58:39,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:39,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret11 := main(); {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#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;havoc ~cond~0; {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {3182#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 != ~p1~0); {3182#true} is VALID [2022-04-08 14:58:39,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume !(0 != ~p2~0); {3182#true} is VALID [2022-04-08 14:58:39,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {3182#true} assume !(0 != ~p3~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:39,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:39,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:39,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:39,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {3187#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:39,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {3187#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:39,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p3~0; {3183#false} is VALID [2022-04-08 14:58:39,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {3183#false} assume 1 != ~lk3~0; {3183#false} is VALID [2022-04-08 14:58:39,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-08 14:58:39,269 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:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:39,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77249910] [2022-04-08 14:58:39,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77249910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:39,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:39,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:39,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [823500883] [2022-04-08 14:58:39,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [823500883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:39,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:39,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782478234] [2022-04-08 14:58:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:39,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 14:58:39,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:39,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:39,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:39,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:39,282 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,378 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-04-08 14:58:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:39,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 14:58:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-08 14:58:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-08 14:58:39,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-08 14:58:39,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:39,447 INFO L225 Difference]: With dead ends: 271 [2022-04-08 14:58:39,447 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 14:58:39,448 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:39,449 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:39,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 14:58:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-08 14:58:39,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:39,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have 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,468 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have 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,468 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have 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,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,471 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-08 14:58:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-08 14:58:39,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:39,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:39,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 14:58:39,472 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 14:58:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,475 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-08 14:58:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-08 14:58:39,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:39,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:39,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:39,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have 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,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-04-08 14:58:39,479 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-04-08 14:58:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:39,479 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-04-08 14:58:39,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have 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,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 247 transitions. [2022-04-08 14:58:39,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-04-08 14:58:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:58:39,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:39,669 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] [2022-04-08 14:58:39,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 14:58:39,669 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-04-08 14:58:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:39,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [423800057] [2022-04-08 14:58:39,671 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 2 times [2022-04-08 14:58:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:39,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997077862] [2022-04-08 14:58:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:39,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {4382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4376#true} is VALID [2022-04-08 14:58:39,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-08 14:58:39,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-08 14:58:39,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {4376#true} call ULTIMATE.init(); {4382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:39,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {4382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4376#true} is VALID [2022-04-08 14:58:39,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-08 14:58:39,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-08 14:58:39,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {4376#true} call #t~ret11 := main(); {4376#true} is VALID [2022-04-08 14:58:39,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {4376#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;havoc ~cond~0; {4376#true} is VALID [2022-04-08 14:58:39,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {4376#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {4376#true} is VALID [2022-04-08 14:58:39,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {4376#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {4376#true} is VALID [2022-04-08 14:58:39,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {4376#true} assume !(0 != ~p1~0); {4376#true} is VALID [2022-04-08 14:58:39,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {4376#true} assume !(0 != ~p2~0); {4376#true} is VALID [2022-04-08 14:58:39,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {4376#true} assume 0 != ~p3~0;~lk3~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:39,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:39,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:39,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:39,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4381#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:39,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4381#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:39,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4377#false} is VALID [2022-04-08 14:58:39,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {4377#false} assume 0 != ~p4~0; {4377#false} is VALID [2022-04-08 14:58:39,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {4377#false} assume 1 != ~lk4~0; {4377#false} is VALID [2022-04-08 14:58:39,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {4377#false} assume !false; {4377#false} is VALID [2022-04-08 14:58:39,718 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:39,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:39,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997077862] [2022-04-08 14:58:39,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997077862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:39,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:39,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:39,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:39,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [423800057] [2022-04-08 14:58:39,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [423800057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:39,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:39,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:39,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934994780] [2022-04-08 14:58:39,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:39,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 14:58:39,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:39,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:39,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:39,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:39,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:39,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:39,731 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,827 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-04-08 14:58:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:39,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 14:58:39,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-08 14:58:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-08 14:58:39,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-08 14:58:39,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:39,895 INFO L225 Difference]: With dead ends: 241 [2022-04-08 14:58:39,895 INFO L226 Difference]: Without dead ends: 167 [2022-04-08 14:58:39,895 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:39,895 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:39,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-08 14:58:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-08 14:58:39,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:39,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have 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,905 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have 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,930 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have 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,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,933 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-08 14:58:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-08 14:58:39,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:39,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:39,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-08 14:58:39,935 INFO L87 Difference]: Start difference. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-08 14:58:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,938 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-08 14:58:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-08 14:58:39,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:39,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:39,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:39,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have 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,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-04-08 14:58:39,942 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-04-08 14:58:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:39,942 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-04-08 14:58:39,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:39,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 251 transitions. [2022-04-08 14:58:40,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-04-08 14:58:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:58:40,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:40,147 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] [2022-04-08 14:58:40,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 14:58:40,147 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-04-08 14:58:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:40,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [532919030] [2022-04-08 14:58:40,148 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 2 times [2022-04-08 14:58:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:40,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234129504] [2022-04-08 14:58:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:40,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {5540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5534#true} is VALID [2022-04-08 14:58:40,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-08 14:58:40,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-08 14:58:40,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {5534#true} call ULTIMATE.init(); {5540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:40,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5534#true} is VALID [2022-04-08 14:58:40,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-08 14:58:40,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-08 14:58:40,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#true} call #t~ret11 := main(); {5534#true} is VALID [2022-04-08 14:58:40,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {5534#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;havoc ~cond~0; {5534#true} is VALID [2022-04-08 14:58:40,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {5534#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {5534#true} is VALID [2022-04-08 14:58:40,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {5534#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {5534#true} is VALID [2022-04-08 14:58:40,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {5534#true} assume !(0 != ~p1~0); {5534#true} is VALID [2022-04-08 14:58:40,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {5534#true} assume !(0 != ~p2~0); {5534#true} is VALID [2022-04-08 14:58:40,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {5534#true} assume !(0 != ~p3~0); {5534#true} is VALID [2022-04-08 14:58:40,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {5534#true} assume 0 != ~p4~0;~lk4~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:40,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:40,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:40,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:40,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:40,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:40,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5539#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:40,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {5539#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5535#false} is VALID [2022-04-08 14:58:40,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {5535#false} assume !false; {5535#false} is VALID [2022-04-08 14:58:40,177 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:40,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:40,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234129504] [2022-04-08 14:58:40,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234129504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:40,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:40,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:40,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:40,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [532919030] [2022-04-08 14:58:40,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [532919030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:40,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:40,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:40,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069444654] [2022-04-08 14:58:40,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:40,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 14:58:40,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:40,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:40,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:40,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:40,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:40,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:40,190 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:40,288 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-04-08 14:58:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:40,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 14:58:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-08 14:58:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-08 14:58:40,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-08 14:58:40,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:40,336 INFO L225 Difference]: With dead ends: 285 [2022-04-08 14:58:40,336 INFO L226 Difference]: Without dead ends: 283 [2022-04-08 14:58:40,336 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:40,337 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:40,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-08 14:58:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-08 14:58:40,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:40,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have 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:40,351 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have 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:40,352 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have 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:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:40,356 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-08 14:58:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-08 14:58:40,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:40,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:40,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-08 14:58:40,357 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-08 14:58:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:40,361 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-08 14:58:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-08 14:58:40,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:40,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:40,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:40,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have 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:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-04-08 14:58:40,365 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-04-08 14:58:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:40,365 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-04-08 14:58:40,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 347 transitions. [2022-04-08 14:58:40,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-04-08 14:58:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:58:40,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:40,646 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] [2022-04-08 14:58:40,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 14:58:40,647 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:40,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-04-08 14:58:40,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:40,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556064394] [2022-04-08 14:58:40,647 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:40,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 2 times [2022-04-08 14:58:40,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:40,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249482544] [2022-04-08 14:58:40,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:40,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:40,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {7154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7148#true} is VALID [2022-04-08 14:58:40,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-08 14:58:40,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-08 14:58:40,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {7148#true} call ULTIMATE.init(); {7154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:40,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {7154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {7148#true} call #t~ret11 := main(); {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {7148#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;havoc ~cond~0; {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {7148#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {7148#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {7148#true} assume !(0 != ~p1~0); {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {7148#true} assume !(0 != ~p2~0); {7148#true} is VALID [2022-04-08 14:58:40,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {7148#true} assume !(0 != ~p3~0); {7148#true} is VALID [2022-04-08 14:58:40,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {7148#true} assume !(0 != ~p4~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:40,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {7153#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:40,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {7153#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:40,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p1~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:40,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p2~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:40,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p3~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:40,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p4~0; {7149#false} is VALID [2022-04-08 14:58:40,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {7149#false} assume 1 != ~lk4~0; {7149#false} is VALID [2022-04-08 14:58:40,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {7149#false} assume !false; {7149#false} is VALID [2022-04-08 14:58:40,708 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:40,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:40,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249482544] [2022-04-08 14:58:40,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249482544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:40,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:40,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:40,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:40,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [556064394] [2022-04-08 14:58:40,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [556064394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:40,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:40,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472482665] [2022-04-08 14:58:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:40,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 14:58:40,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:40,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:40,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:40,720 INFO L87 Difference]: Start difference. First operand 233 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:40,843 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-04-08 14:58:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 14:58:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 14:58:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 14:58:40,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-08 14:58:40,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:40,910 INFO L225 Difference]: With dead ends: 525 [2022-04-08 14:58:40,910 INFO L226 Difference]: Without dead ends: 307 [2022-04-08 14:58:40,912 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:40,913 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:40,914 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-08 14:58:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-08 14:58:40,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:40,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have 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:40,936 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have 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:40,936 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have 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:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:40,941 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-08 14:58:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-08 14:58:40,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:40,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:40,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-08 14:58:40,942 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-08 14:58:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:40,946 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-08 14:58:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-08 14:58:40,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:40,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:40,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:40,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have 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:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-04-08 14:58:40,952 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-04-08 14:58:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:40,952 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-04-08 14:58:40,952 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 305 states and 439 transitions. [2022-04-08 14:58:41,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-04-08 14:58:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:58:41,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:41,323 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] [2022-04-08 14:58:41,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 14:58:41,323 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-04-08 14:58:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:41,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [674822340] [2022-04-08 14:58:41,324 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 2 times [2022-04-08 14:58:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:41,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510613749] [2022-04-08 14:58:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:41,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:41,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:41,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {9440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9434#true} is VALID [2022-04-08 14:58:41,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-08 14:58:41,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-08 14:58:41,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {9434#true} call ULTIMATE.init(); {9440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:41,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {9440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9434#true} is VALID [2022-04-08 14:58:41,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {9434#true} call #t~ret11 := main(); {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {9434#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;havoc ~cond~0; {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {9434#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {9434#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {9434#true} assume !(0 != ~p1~0); {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {9434#true} assume !(0 != ~p2~0); {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {9434#true} assume !(0 != ~p3~0); {9434#true} is VALID [2022-04-08 14:58:41,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {9434#true} assume 0 != ~p4~0;~lk4~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:41,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {9439#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:41,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {9439#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:41,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:41,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:41,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:41,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {9435#false} is VALID [2022-04-08 14:58:41,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {9435#false} assume 0 != ~p5~0; {9435#false} is VALID [2022-04-08 14:58:41,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#false} assume 1 != ~lk5~0; {9435#false} is VALID [2022-04-08 14:58:41,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#false} assume !false; {9435#false} is VALID [2022-04-08 14:58:41,365 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:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:41,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510613749] [2022-04-08 14:58:41,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510613749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:41,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:41,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:41,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:41,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [674822340] [2022-04-08 14:58:41,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [674822340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:41,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:41,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985650415] [2022-04-08 14:58:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:58:41,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:41,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:41,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:41,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:41,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:41,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:41,377 INFO L87 Difference]: Start difference. First operand 305 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:41,486 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-04-08 14:58:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:41,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:58:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-08 14:58:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-08 14:58:41,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-08 14:58:41,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:41,549 INFO L225 Difference]: With dead ends: 457 [2022-04-08 14:58:41,549 INFO L226 Difference]: Without dead ends: 315 [2022-04-08 14:58:41,549 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:41,550 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:41,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-08 14:58:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-08 14:58:41,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:41,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have 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:41,566 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have 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:41,566 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have 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:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:41,572 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-08 14:58:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-08 14:58:41,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:41,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:41,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-08 14:58:41,573 INFO L87 Difference]: Start difference. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-08 14:58:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:41,578 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-08 14:58:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-08 14:58:41,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:41,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:41,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:41,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have 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:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-04-08 14:58:41,584 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-04-08 14:58:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:41,584 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-04-08 14:58:41,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:41,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 439 transitions. [2022-04-08 14:58:41,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-04-08 14:58:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:58:41,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:41,966 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] [2022-04-08 14:58:41,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 14:58:41,966 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-04-08 14:58:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:41,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [593860377] [2022-04-08 14:58:41,967 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 2 times [2022-04-08 14:58:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:41,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141205814] [2022-04-08 14:58:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:42,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {11622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11616#true} is VALID [2022-04-08 14:58:42,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-08 14:58:42,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {11616#true} call ULTIMATE.init(); {11622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:42,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {11622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {11616#true} call #t~ret11 := main(); {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {11616#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;havoc ~cond~0; {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {11616#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {11616#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {11616#true} assume !(0 != ~p1~0); {11616#true} is VALID [2022-04-08 14:58:42,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {11616#true} assume !(0 != ~p2~0); {11616#true} is VALID [2022-04-08 14:58:42,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {11616#true} assume !(0 != ~p3~0); {11616#true} is VALID [2022-04-08 14:58:42,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {11616#true} assume !(0 != ~p4~0); {11616#true} is VALID [2022-04-08 14:58:42,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {11616#true} assume 0 != ~p5~0;~lk5~0 := 1; {11621#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:42,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {11621#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11621#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:42,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:42,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:42,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:42,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:42,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {11621#(= main_~lk5~0 1)} assume 0 != ~p5~0; {11621#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:42,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {11621#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {11617#false} is VALID [2022-04-08 14:58:42,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {11617#false} assume !false; {11617#false} is VALID [2022-04-08 14:58:42,021 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:42,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:42,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141205814] [2022-04-08 14:58:42,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141205814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:42,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:42,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:42,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:42,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [593860377] [2022-04-08 14:58:42,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [593860377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:42,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:42,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902504205] [2022-04-08 14:58:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:58:42,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:42,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:42,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:42,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:42,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:42,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:42,033 INFO L87 Difference]: Start difference. First operand 313 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:42,154 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-04-08 14:58:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:42,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:58:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-08 14:58:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-08 14:58:42,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-08 14:58:42,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:42,210 INFO L225 Difference]: With dead ends: 525 [2022-04-08 14:58:42,210 INFO L226 Difference]: Without dead ends: 523 [2022-04-08 14:58:42,210 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:42,210 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:42,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-08 14:58:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-08 14:58:42,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:42,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have 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:42,234 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have 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:42,234 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have 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:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:42,244 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-08 14:58:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-08 14:58:42,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:42,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:42,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-08 14:58:42,246 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-08 14:58:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:42,255 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-08 14:58:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-08 14:58:42,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:42,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:42,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:42,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have 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:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-04-08 14:58:42,266 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-04-08 14:58:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:42,266 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-04-08 14:58:42,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:42,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 623 transitions. [2022-04-08 14:58:42,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-04-08 14:58:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:58:42,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:42,841 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] [2022-04-08 14:58:42,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 14:58:42,842 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:42,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-04-08 14:58:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:42,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1948358587] [2022-04-08 14:58:42,842 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 2 times [2022-04-08 14:58:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:42,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682569896] [2022-04-08 14:58:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:42,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {14644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14638#true} is VALID [2022-04-08 14:58:42,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-08 14:58:42,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-08 14:58:42,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {14638#true} call ULTIMATE.init(); {14644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:42,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {14644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14638#true} is VALID [2022-04-08 14:58:42,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-08 14:58:42,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {14638#true} call #t~ret11 := main(); {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {14638#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;havoc ~cond~0; {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {14638#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {14638#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {14638#true} assume !(0 != ~p1~0); {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {14638#true} assume !(0 != ~p2~0); {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {14638#true} assume !(0 != ~p3~0); {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {14638#true} assume !(0 != ~p4~0); {14638#true} is VALID [2022-04-08 14:58:42,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {14638#true} assume !(0 != ~p5~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:42,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14643#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:42,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p1~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:42,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p2~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:42,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p3~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:42,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p4~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:42,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p5~0; {14639#false} is VALID [2022-04-08 14:58:42,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {14639#false} assume 1 != ~lk5~0; {14639#false} is VALID [2022-04-08 14:58:42,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#false} assume !false; {14639#false} is VALID [2022-04-08 14:58:42,895 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:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682569896] [2022-04-08 14:58:42,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682569896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:42,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:42,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:42,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1948358587] [2022-04-08 14:58:42,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1948358587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:42,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:42,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391337600] [2022-04-08 14:58:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:42,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:58:42,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:42,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:42,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:42,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:42,906 INFO L87 Difference]: Start difference. First operand 457 states and 623 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:43,097 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-04-08 14:58:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:58:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 14:58:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 14:58:43,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-08 14:58:43,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:43,182 INFO L225 Difference]: With dead ends: 1021 [2022-04-08 14:58:43,182 INFO L226 Difference]: Without dead ends: 587 [2022-04-08 14:58:43,183 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:43,183 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:43,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-08 14:58:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-08 14:58:43,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:43,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have 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:43,214 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have 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:43,215 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have 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:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:43,228 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-08 14:58:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-08 14:58:43,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:43,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:43,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-08 14:58:43,230 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-08 14:58:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:43,248 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-08 14:58:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-08 14:58:43,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:43,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:43,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:43,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have 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:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-04-08 14:58:43,292 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-04-08 14:58:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:43,292 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-04-08 14:58:43,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:43,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 759 transitions. [2022-04-08 14:58:43,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-04-08 14:58:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:58:43,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:43,940 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:43,940 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 14:58:43,940 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:43,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-04-08 14:58:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:43,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1650459680] [2022-04-08 14:58:43,941 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 2 times [2022-04-08 14:58:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:43,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921404468] [2022-04-08 14:58:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:43,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {19042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19036#true} is VALID [2022-04-08 14:58:43,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-08 14:58:43,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-08 14:58:43,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {19036#true} call ULTIMATE.init(); {19042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:43,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {19042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19036#true} is VALID [2022-04-08 14:58:43,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-08 14:58:43,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-08 14:58:43,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {19036#true} call #t~ret11 := main(); {19036#true} is VALID [2022-04-08 14:58:43,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {19036#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;havoc ~cond~0; {19036#true} is VALID [2022-04-08 14:58:43,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {19036#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {19036#true} is VALID [2022-04-08 14:58:43,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {19036#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {19036#true} is VALID [2022-04-08 14:58:43,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {19036#true} assume !(0 != ~p1~0); {19036#true} is VALID [2022-04-08 14:58:43,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {19036#true} assume !(0 != ~p2~0); {19036#true} is VALID [2022-04-08 14:58:43,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {19036#true} assume !(0 != ~p3~0); {19036#true} is VALID [2022-04-08 14:58:43,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {19036#true} assume !(0 != ~p4~0); {19036#true} is VALID [2022-04-08 14:58:43,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {19036#true} assume 0 != ~p5~0;~lk5~0 := 1; {19041#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:43,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {19041#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19041#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:43,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:43,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:43,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:43,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:58:43,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {19037#false} is VALID [2022-04-08 14:58:43,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {19037#false} assume 0 != ~p6~0; {19037#false} is VALID [2022-04-08 14:58:43,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {19037#false} assume 1 != ~lk6~0; {19037#false} is VALID [2022-04-08 14:58:43,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {19037#false} assume !false; {19037#false} is VALID [2022-04-08 14:58:43,979 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:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:43,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921404468] [2022-04-08 14:58:43,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921404468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:43,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:43,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:43,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:43,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1650459680] [2022-04-08 14:58:43,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1650459680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:43,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:43,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71948565] [2022-04-08 14:58:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:43,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:58:43,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:43,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:44,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:44,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:44,004 INFO L87 Difference]: Start difference. First operand 585 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:44,184 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-04-08 14:58:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:44,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:58:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 14:58:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 14:58:44,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 14:58:44,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:44,257 INFO L225 Difference]: With dead ends: 877 [2022-04-08 14:58:44,257 INFO L226 Difference]: Without dead ends: 603 [2022-04-08 14:58:44,257 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:44,258 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:44,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-08 14:58:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-08 14:58:44,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:44,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have 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:44,289 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have 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:44,290 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have 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:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:44,301 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-08 14:58:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-08 14:58:44,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:44,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:44,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-08 14:58:44,303 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-08 14:58:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:44,314 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-08 14:58:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-08 14:58:44,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:44,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:44,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:44,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have 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:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-04-08 14:58:44,329 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-04-08 14:58:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:44,329 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-04-08 14:58:44,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:44,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 759 transitions. [2022-04-08 14:58:45,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-04-08 14:58:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:58:45,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:45,005 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:45,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 14:58:45,005 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-04-08 14:58:45,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:45,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169861285] [2022-04-08 14:58:45,006 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 2 times [2022-04-08 14:58:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:45,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065687869] [2022-04-08 14:58:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:45,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:45,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {23216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {23210#true} is VALID [2022-04-08 14:58:45,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-08 14:58:45,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-08 14:58:45,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {23210#true} call ULTIMATE.init(); {23216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:45,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {23216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {23210#true} is VALID [2022-04-08 14:58:45,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {23210#true} call #t~ret11 := main(); {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {23210#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;havoc ~cond~0; {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {23210#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {23210#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {23210#true} assume !(0 != ~p1~0); {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {23210#true} assume !(0 != ~p2~0); {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {23210#true} assume !(0 != ~p3~0); {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {23210#true} assume !(0 != ~p4~0); {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {23210#true} assume !(0 != ~p5~0); {23210#true} is VALID [2022-04-08 14:58:45,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {23210#true} assume 0 != ~p6~0;~lk6~0 := 1; {23215#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:45,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:45,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:45,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:45,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:45,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:45,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {23215#(= main_~lk6~0 1)} assume 0 != ~p6~0; {23215#(= main_~lk6~0 1)} is VALID [2022-04-08 14:58:45,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {23215#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {23211#false} is VALID [2022-04-08 14:58:45,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {23211#false} assume !false; {23211#false} is VALID [2022-04-08 14:58:45,052 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:45,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:45,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065687869] [2022-04-08 14:58:45,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065687869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:45,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:45,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:45,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:45,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169861285] [2022-04-08 14:58:45,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169861285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:45,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:45,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:45,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664247169] [2022-04-08 14:58:45,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:58:45,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:45,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:45,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:45,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:45,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:45,067 INFO L87 Difference]: Start difference. First operand 601 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:45,227 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-04-08 14:58:45,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:45,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:58:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-08 14:58:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-08 14:58:45,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-08 14:58:45,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:45,307 INFO L225 Difference]: With dead ends: 971 [2022-04-08 14:58:45,307 INFO L226 Difference]: Without dead ends: 969 [2022-04-08 14:58:45,308 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:45,309 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:45,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-08 14:58:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-08 14:58:45,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:45,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,382 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,383 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:45,408 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-08 14:58:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-08 14:58:45,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:45,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:45,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 969 states. [2022-04-08 14:58:45,411 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 969 states. [2022-04-08 14:58:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:45,436 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-08 14:58:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-08 14:58:45,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:45,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:45,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:45,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-04-08 14:58:45,476 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-04-08 14:58:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:45,476 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-04-08 14:58:45,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:45,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1111 transitions. [2022-04-08 14:58:46,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-04-08 14:58:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:58:46,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:46,506 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:46,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 14:58:46,506 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-04-08 14:58:46,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:46,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704815076] [2022-04-08 14:58:46,507 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 2 times [2022-04-08 14:58:46,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:46,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177123002] [2022-04-08 14:58:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:46,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {28918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {28912#true} is VALID [2022-04-08 14:58:46,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-08 14:58:46,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-08 14:58:46,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {28912#true} call ULTIMATE.init(); {28918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:46,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {28918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {28912#true} is VALID [2022-04-08 14:58:46,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {28912#true} call #t~ret11 := main(); {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {28912#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;havoc ~cond~0; {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {28912#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {28912#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {28912#true} assume !(0 != ~p1~0); {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {28912#true} assume !(0 != ~p2~0); {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {28912#true} assume !(0 != ~p3~0); {28912#true} is VALID [2022-04-08 14:58:46,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {28912#true} assume !(0 != ~p4~0); {28912#true} is VALID [2022-04-08 14:58:46,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {28912#true} assume !(0 != ~p5~0); {28912#true} is VALID [2022-04-08 14:58:46,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {28912#true} assume !(0 != ~p6~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:46,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p1~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:46,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p2~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:46,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p3~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:46,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p4~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:46,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p5~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-08 14:58:46,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {28917#(= main_~p6~0 0)} assume 0 != ~p6~0; {28913#false} is VALID [2022-04-08 14:58:46,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {28913#false} assume 1 != ~lk6~0; {28913#false} is VALID [2022-04-08 14:58:46,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {28913#false} assume !false; {28913#false} is VALID [2022-04-08 14:58:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:46,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177123002] [2022-04-08 14:58:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177123002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:46,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:46,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:46,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704815076] [2022-04-08 14:58:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704815076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:46,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:46,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418985029] [2022-04-08 14:58:46,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:58:46,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:46,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:46,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:46,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:46,586 INFO L87 Difference]: Start difference. First operand 905 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:46,948 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-04-08 14:58:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:46,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:58:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 14:58:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 14:58:46,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 14:58:47,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:47,016 INFO L225 Difference]: With dead ends: 1993 [2022-04-08 14:58:47,016 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:58:47,018 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:47,020 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:47,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:58:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:58:47,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:47,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:58:47,020 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:58:47,020 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:58:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:47,021 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:58:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:58:47,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:47,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:47,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:58:47,021 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:58:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:47,021 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:58:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:58:47,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:47,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:47,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:47,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:58:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:58:47,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-08 14:58:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:47,021 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:58:47,022 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:47,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:58:47,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:58:47,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:47,024 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:58:47,024 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 14:58:47,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:58:55,051 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 14:58:55,052 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 14:58:55,052 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 14:58:55,052 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:58:55,052 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 14:58:55,052 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:58:55,052 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:58:55,052 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 14:58:55,053 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:58:55,053 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:58:55,054 INFO L878 garLoopResultBuilder]: At program point L60-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-08 14:58:55,054 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-04-08 14:58:55,054 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse7 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse7 .cse3 .cse6 .cse5) (and .cse0 .cse7 .cse3 .cse6 .cse4))) [2022-04-08 14:58:55,054 INFO L878 garLoopResultBuilder]: At program point L52-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-08 14:58:55,054 INFO L878 garLoopResultBuilder]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2022-04-08 14:58:55,054 INFO L878 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk5~0 1))) (or (and .cse0 .cse1 (= main_~p6~0 0)) (and .cse0 .cse1 (= main_~lk6~0 1)))) [2022-04-08 14:58:55,054 INFO L878 garLoopResultBuilder]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse7 (= main_~p6~0 0)) (.cse3 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse6 .cse2) (and .cse5 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse7 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse0 .cse4 .cse6 .cse7) (and .cse4 .cse5 .cse7 .cse3))) [2022-04-08 14:58:55,055 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-04-08 14:58:55,055 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-04-08 14:58:55,055 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-04-08 14:58:55,055 INFO L878 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~p3~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0)) (.cse4 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse2 .cse4) (and .cse7 .cse8 .cse1 .cse5 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse5 .cse4) (and .cse0 .cse8 .cse1 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse5 .cse4))) [2022-04-08 14:58:55,055 INFO L885 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-04-08 14:58:55,055 INFO L885 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-04-08 14:58:55,055 INFO L878 garLoopResultBuilder]: At program point L64-1(lines 29 104) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-08 14:58:55,055 INFO L878 garLoopResultBuilder]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-08 14:58:55,055 INFO L878 garLoopResultBuilder]: At program point L56-1(lines 29 104) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-08 14:58:55,055 INFO L885 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-04-08 14:58:55,055 INFO L878 garLoopResultBuilder]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-08 14:58:55,056 INFO L878 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse4 (= main_~p5~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse5))) [2022-04-08 14:58:55,056 INFO L878 garLoopResultBuilder]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse8 (= main_~p4~0 0)) (.cse2 (= main_~p2~0 0)) (.cse6 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse7 (= main_~p6~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse8 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse6 .cse3 .cse4 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse8 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse0 .cse7 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse4 .cse9) (and .cse1 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse1 .cse6 .cse2 .cse7 .cse4) (and .cse1 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse1 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse7) (and .cse8 .cse0 .cse3 .cse4 .cse9) (and .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse7 .cse9) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9))) [2022-04-08 14:58:55,056 INFO L885 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-04-08 14:58:55,056 INFO L878 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse8 (= main_~p5~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse10 (= main_~p2~0 0)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse11 (= main_~lk3~0 1)) (.cse9 (= main_~lk6~0 1)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse9 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse9 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse4 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse9 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse4) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse9 .cse6))) [2022-04-08 14:58:55,056 INFO L878 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-04-08 14:58:55,056 INFO L878 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-04-08 14:58:55,056 INFO L878 garLoopResultBuilder]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse4 (= main_~p5~0 0)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse4 .cse3) (and .cse0 .cse4 .cse3) (and .cse1 .cse5 .cse2) (and .cse5 .cse4 .cse2) (and .cse1 .cse5 .cse3))) [2022-04-08 14:58:55,057 INFO L878 garLoopResultBuilder]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-08 14:58:55,059 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 14:58:55,059 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:58:55,063 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:58:55,064 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:58:55,104 INFO L163 areAnnotationChecker]: CFG has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:58:55,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:58:55 BoogieIcfgContainer [2022-04-08 14:58:55,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:58:55,114 INFO L158 Benchmark]: Toolchain (without parser) took 19162.71ms. Allocated memory was 170.9MB in the beginning and 475.0MB in the end (delta: 304.1MB). Free memory was 119.9MB in the beginning and 384.0MB in the end (delta: -264.1MB). Peak memory consumption was 261.1MB. Max. memory is 8.0GB. [2022-04-08 14:58:55,114 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 170.9MB. Free memory was 136.6MB in the beginning and 136.5MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:58:55,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.38ms. Allocated memory was 170.9MB in the beginning and 221.2MB in the end (delta: 50.3MB). Free memory was 119.8MB in the beginning and 197.7MB in the end (delta: -77.9MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-08 14:58:55,114 INFO L158 Benchmark]: Boogie Preprocessor took 20.72ms. Allocated memory is still 221.2MB. Free memory was 197.7MB in the beginning and 196.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 14:58:55,114 INFO L158 Benchmark]: RCFGBuilder took 239.89ms. Allocated memory is still 221.2MB. Free memory was 196.1MB in the beginning and 183.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 14:58:55,114 INFO L158 Benchmark]: TraceAbstraction took 18620.82ms. Allocated memory was 221.2MB in the beginning and 475.0MB in the end (delta: 253.8MB). Free memory was 183.0MB in the beginning and 384.0MB in the end (delta: -201.0MB). Peak memory consumption was 274.1MB. Max. memory is 8.0GB. [2022-04-08 14:58:55,115 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 170.9MB. Free memory was 136.6MB in the beginning and 136.5MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.38ms. Allocated memory was 170.9MB in the beginning and 221.2MB in the end (delta: 50.3MB). Free memory was 119.8MB in the beginning and 197.7MB in the end (delta: -77.9MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.72ms. Allocated memory is still 221.2MB. Free memory was 197.7MB in the beginning and 196.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 239.89ms. Allocated memory is still 221.2MB. Free memory was 196.1MB in the beginning and 183.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18620.82ms. Allocated memory was 221.2MB in the beginning and 475.0MB in the end (delta: 253.8MB). Free memory was 183.0MB in the beginning and 384.0MB in the end (delta: -201.0MB). Peak memory consumption was 274.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 894 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 1162 NumberOfFragments, 4131 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 14:58:55,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...