/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:58:50,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:58:50,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:58:50,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:58:50,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:58:50,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:58:50,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:58:50,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:58:50,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:58:50,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:58:50,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:58:50,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:58:50,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:58:50,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:58:50,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:58:50,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:58:50,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:58:50,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:58:50,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:58:50,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:58:50,892 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:58:50,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:58:50,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:58:50,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:58:50,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:58:50,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:58:50,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:58:50,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:58:50,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:58:50,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:58:50,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:58:50,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:58:50,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:58:50,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:58:50,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:58:50,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:58:50,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:58:50,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:58:50,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:58:50,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:58:50,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:58:50,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:58:50,911 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:50,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:58:50,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:58:50,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:58:50,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:58:50,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:58:50,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:58:50,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:58:50,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:58:50,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:58:50,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:58:50,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:58:50,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:58:50,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:58:50,924 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:58:50,924 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:51,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:58:51,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:58:51,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:58:51,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:58:51,132 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:58:51,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-04-08 14:58:51,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da784c186/99a62850c7514774b6e7c9728d69d3f6/FLAGbe02c329c [2022-04-08 14:58:51,474 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:58:51,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-04-08 14:58:51,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da784c186/99a62850c7514774b6e7c9728d69d3f6/FLAGbe02c329c [2022-04-08 14:58:51,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da784c186/99a62850c7514774b6e7c9728d69d3f6 [2022-04-08 14:58:51,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:58:51,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:58:51,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:58:51,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:58:51,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:58:51,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:58:51" (1/1) ... [2022-04-08 14:58:51,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ae8ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:51, skipping insertion in model container [2022-04-08 14:58:51,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:58:51" (1/1) ... [2022-04-08 14:58:51,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:58:51,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:58:52,103 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_7.c[2881,2894] [2022-04-08 14:58:52,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:58:52,111 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:58:52,142 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_7.c[2881,2894] [2022-04-08 14:58:52,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:58:52,154 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:58:52,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:52 WrapperNode [2022-04-08 14:58:52,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:58:52,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:58:52,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:58:52,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:58:52,162 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:52" (1/1) ... [2022-04-08 14:58:52,163 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:52" (1/1) ... [2022-04-08 14:58:52,168 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:52" (1/1) ... [2022-04-08 14:58:52,168 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:52" (1/1) ... [2022-04-08 14:58:52,181 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:52" (1/1) ... [2022-04-08 14:58:52,189 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:52" (1/1) ... [2022-04-08 14:58:52,190 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:52" (1/1) ... [2022-04-08 14:58:52,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:58:52,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:58:52,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:58:52,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:58:52,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:52" (1/1) ... [2022-04-08 14:58:52,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:58:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:58:52,216 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:52,233 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:52,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:58:52,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:58:52,244 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:58:52,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:58:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:58:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:58:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:58:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:58:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:58:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:58:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:58:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:58:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:58:52,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:58:52,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:58:52,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:58:52,300 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:58:52,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:58:52,470 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:58:52,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:58:52,475 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:58:52,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:58:52 BoogieIcfgContainer [2022-04-08 14:58:52,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:58:52,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:58:52,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:58:52,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:58:52,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:58:51" (1/3) ... [2022-04-08 14:58:52,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a430cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:58:52, skipping insertion in model container [2022-04-08 14:58:52,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:52" (2/3) ... [2022-04-08 14:58:52,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a430cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:58:52, skipping insertion in model container [2022-04-08 14:58:52,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:58:52" (3/3) ... [2022-04-08 14:58:52,484 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-04-08 14:58:52,488 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:58:52,488 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:58:52,524 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:58:52,531 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:52,531 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:58:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:58:52,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:52,556 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:52,556 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-04-08 14:58:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:52,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [686671496] [2022-04-08 14:58:52,575 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 2 times [2022-04-08 14:58:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:52,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992566661] [2022-04-08 14:58:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:52,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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); {39#true} is VALID [2022-04-08 14:58:52,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-08 14:58:52,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-08 14:58:52,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:52,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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); {39#true} is VALID [2022-04-08 14:58:52,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-08 14:58:52,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-08 14:58:52,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret12 := main(); {39#true} is VALID [2022-04-08 14:58:52,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {39#true} is VALID [2022-04-08 14:58:52,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {39#true} is VALID [2022-04-08 14:58:52,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {39#true} is VALID [2022-04-08 14:58:52,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 != ~p1~0;~lk1~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:52,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {44#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:52,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:52,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:52,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:52,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:52,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:52,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p1~0; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:52,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {40#false} is VALID [2022-04-08 14:58:52,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-08 14:58:52,784 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:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:52,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992566661] [2022-04-08 14:58:52,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992566661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:52,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:52,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:52,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:52,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [686671496] [2022-04-08 14:58:52,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [686671496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:52,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:52,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780468118] [2022-04-08 14:58:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:52,792 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:52,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:52,795 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:52,823 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:52,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:52,838 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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.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:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:53,060 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-08 14:58:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:53,060 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:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:53,061 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:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:58:53,077 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:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:58:53,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 14:58:53,176 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:53,184 INFO L225 Difference]: With dead ends: 70 [2022-04-08 14:58:53,184 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 14:58:53,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:53,190 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:53,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:58:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 14:58:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-04-08 14:58:53,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:53,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:53,218 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:53,218 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:53,222 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-08 14:58:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-08 14:58:53,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:53,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:53,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 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 55 states. [2022-04-08 14:58:53,224 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 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 55 states. [2022-04-08 14:58:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:53,228 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-08 14:58:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-08 14:58:53,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:53,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:53,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:53,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-04-08 14:58:53,232 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-04-08 14:58:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:53,233 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-04-08 14:58:53,233 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:53,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 66 transitions. [2022-04-08 14:58:53,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-04-08 14:58:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:58:53,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:53,296 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:53,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:58:53,296 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:53,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-04-08 14:58:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:53,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574649569] [2022-04-08 14:58:53,297 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 2 times [2022-04-08 14:58:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:53,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758520460] [2022-04-08 14:58:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:53,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(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); {379#true} is VALID [2022-04-08 14:58:53,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-08 14:58:53,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #149#return; {379#true} is VALID [2022-04-08 14:58:53,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:53,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(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); {379#true} is VALID [2022-04-08 14:58:53,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-08 14:58:53,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #149#return; {379#true} is VALID [2022-04-08 14:58:53,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret12 := main(); {379#true} is VALID [2022-04-08 14:58:53,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {379#true} is VALID [2022-04-08 14:58:53,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {379#true} is VALID [2022-04-08 14:58:53,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {379#true} is VALID [2022-04-08 14:58:53,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#true} assume !(0 != ~p1~0); {384#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:53,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(= main_~p1~0 0)} assume !(0 != ~p2~0); {384#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:53,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:53,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:53,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:53,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:53,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 14:58:53,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p1~0; {380#false} is VALID [2022-04-08 14:58:53,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {380#false} assume 1 != ~lk1~0; {380#false} is VALID [2022-04-08 14:58:53,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-08 14:58:53,364 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:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:53,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758520460] [2022-04-08 14:58:53,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758520460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:53,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:53,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:53,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:53,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574649569] [2022-04-08 14:58:53,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574649569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:53,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:53,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224478913] [2022-04-08 14:58:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:53,368 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:53,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:53,369 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:53,381 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:53,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:53,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:53,382 INFO L87 Difference]: Start difference. First operand 39 states and 66 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:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:53,544 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-08 14:58:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:53,545 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:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:53,545 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:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 14:58:53,547 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:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 14:58:53,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-08 14:58:53,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:53,722 INFO L225 Difference]: With dead ends: 88 [2022-04-08 14:58:53,722 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 14:58:53,731 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:53,732 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:53,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 14:58:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-08 14:58:53,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:53,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:53,753 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:53,753 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:53,755 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-08 14:58:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-08 14:58:53,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:53,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:53,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 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 55 states. [2022-04-08 14:58:53,756 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 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 55 states. [2022-04-08 14:58:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:53,758 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-08 14:58:53,758 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-08 14:58:53,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:53,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:53,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:53,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-04-08 14:58:53,761 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-04-08 14:58:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:53,761 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-04-08 14:58:53,762 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:53,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 90 transitions. [2022-04-08 14:58:53,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-04-08 14:58:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 14:58:53,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:53,826 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:53,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:58:53,826 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:53,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-04-08 14:58:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:53,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843346961] [2022-04-08 14:58:53,830 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 2 times [2022-04-08 14:58:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:53,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3309529] [2022-04-08 14:58:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:53,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:53,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:53,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(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); {783#true} is VALID [2022-04-08 14:58:53,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-08 14:58:53,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {783#true} {783#true} #149#return; {783#true} is VALID [2022-04-08 14:58:53,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:53,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(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); {783#true} is VALID [2022-04-08 14:58:53,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-08 14:58:53,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #149#return; {783#true} is VALID [2022-04-08 14:58:53,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret12 := main(); {783#true} is VALID [2022-04-08 14:58:53,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {783#true} is VALID [2022-04-08 14:58:53,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {783#true} is VALID [2022-04-08 14:58:53,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {783#true} is VALID [2022-04-08 14:58:53,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume 0 != ~p1~0;~lk1~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:53,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:53,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:53,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:53,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:53,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:53,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:58:53,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {784#false} is VALID [2022-04-08 14:58:53,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#false} assume 0 != ~p2~0; {784#false} is VALID [2022-04-08 14:58:53,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#false} assume 1 != ~lk2~0; {784#false} is VALID [2022-04-08 14:58:53,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-08 14:58:53,900 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:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:53,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3309529] [2022-04-08 14:58:53,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3309529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:53,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:53,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:53,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843346961] [2022-04-08 14:58:53,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843346961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:53,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:53,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329841097] [2022-04-08 14:58:53,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:53,902 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:53,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:53,902 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:53,912 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:53,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:53,913 INFO L87 Difference]: Start difference. First operand 53 states and 90 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:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,035 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-04-08 14:58:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:54,036 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:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:54,036 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:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 14:58:54,038 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:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 14:58:54,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-08 14:58:54,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:54,142 INFO L225 Difference]: With dead ends: 82 [2022-04-08 14:58:54,142 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 14:58:54,142 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:54,143 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:54,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 14:58:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-08 14:58:54,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:54,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call 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:54,151 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call 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:54,152 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call 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:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,157 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-08 14:58:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-08 14:58:54,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:54,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:54,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 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 58 states. [2022-04-08 14:58:54,159 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 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 58 states. [2022-04-08 14:58:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,165 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-08 14:58:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-08 14:58:54,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:54,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:54,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:54,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call 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:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-04-08 14:58:54,172 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-04-08 14:58:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:54,172 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-04-08 14:58:54,172 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:54,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 92 transitions. [2022-04-08 14:58:54,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-04-08 14:58:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 14:58:54,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:54,236 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:54,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:58:54,236 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-04-08 14:58:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:54,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896391584] [2022-04-08 14:58:54,237 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 2 times [2022-04-08 14:58:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:54,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855299464] [2022-04-08 14:58:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:54,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:54,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {1193#(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); {1187#true} is VALID [2022-04-08 14:58:54,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-08 14:58:54,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1187#true} {1187#true} #149#return; {1187#true} is VALID [2022-04-08 14:58:54,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {1187#true} call ULTIMATE.init(); {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:54,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#(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); {1187#true} is VALID [2022-04-08 14:58:54,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-08 14:58:54,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1187#true} {1187#true} #149#return; {1187#true} is VALID [2022-04-08 14:58:54,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {1187#true} call #t~ret12 := main(); {1187#true} is VALID [2022-04-08 14:58:54,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {1187#true} is VALID [2022-04-08 14:58:54,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1187#true} is VALID [2022-04-08 14:58:54,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1187#true} is VALID [2022-04-08 14:58:54,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#true} assume !(0 != ~p1~0); {1187#true} is VALID [2022-04-08 14:58:54,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#true} assume !(0 != ~p2~0); {1192#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:54,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:54,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:54,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:54,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:54,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:54,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1192#(= main_~p2~0 0)} is VALID [2022-04-08 14:58:54,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p2~0; {1188#false} is VALID [2022-04-08 14:58:54,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#false} assume 1 != ~lk2~0; {1188#false} is VALID [2022-04-08 14:58:54,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2022-04-08 14:58:54,280 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:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:54,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855299464] [2022-04-08 14:58:54,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855299464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:54,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:54,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:54,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:54,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896391584] [2022-04-08 14:58:54,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896391584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:54,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:54,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381852253] [2022-04-08 14:58:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:54,281 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:54,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:54,282 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:54,292 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:54,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:54,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:54,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:54,293 INFO L87 Difference]: Start difference. First operand 56 states and 92 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:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,424 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-04-08 14:58:54,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:54,424 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:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:54,424 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:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 14:58:54,426 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:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 14:58:54,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-08 14:58:54,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:54,511 INFO L225 Difference]: With dead ends: 148 [2022-04-08 14:58:54,512 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 14:58:54,512 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:54,512 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:54,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 14:58:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-08 14:58:54,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:54,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call 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:54,521 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call 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:54,522 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call 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:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,524 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-08 14:58:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-08 14:58:54,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:54,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:54,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 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 101 states. [2022-04-08 14:58:54,525 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 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 101 states. [2022-04-08 14:58:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,527 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-08 14:58:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-08 14:58:54,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:54,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:54,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:54,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call 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:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-04-08 14:58:54,531 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-04-08 14:58:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:54,531 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-04-08 14:58:54,531 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:54,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 165 transitions. [2022-04-08 14:58:54,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-04-08 14:58:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 14:58:54,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:54,661 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:54,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:58:54,661 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-04-08 14:58:54,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:54,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794847252] [2022-04-08 14:58:54,662 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 2 times [2022-04-08 14:58:54,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:54,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468030995] [2022-04-08 14:58:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:54,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:54,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {1901#(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); {1895#true} is VALID [2022-04-08 14:58:54,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-08 14:58:54,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #149#return; {1895#true} is VALID [2022-04-08 14:58:54,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:54,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#(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); {1895#true} is VALID [2022-04-08 14:58:54,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-08 14:58:54,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #149#return; {1895#true} is VALID [2022-04-08 14:58:54,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret12 := main(); {1895#true} is VALID [2022-04-08 14:58:54,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {1895#true} is VALID [2022-04-08 14:58:54,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1895#true} is VALID [2022-04-08 14:58:54,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1895#true} is VALID [2022-04-08 14:58:54,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} assume !(0 != ~p1~0); {1895#true} is VALID [2022-04-08 14:58:54,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#true} assume 0 != ~p2~0;~lk2~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:54,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:54,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:54,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:54,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:54,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:54,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:54,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 14:58:54,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1896#false} is VALID [2022-04-08 14:58:54,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-08 14:58:54,706 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:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468030995] [2022-04-08 14:58:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468030995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:54,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:54,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794847252] [2022-04-08 14:58:54,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794847252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:54,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:54,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:54,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280114211] [2022-04-08 14:58:54,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:54,707 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:54,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:54,708 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:54,718 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:54,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:54,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:54,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:54,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:54,719 INFO L87 Difference]: Start difference. First operand 99 states and 165 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:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,832 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-04-08 14:58:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:54,832 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:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:54,832 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:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-08 14:58:54,834 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:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-08 14:58:54,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-08 14:58:54,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:54,899 INFO L225 Difference]: With dead ends: 127 [2022-04-08 14:58:54,899 INFO L226 Difference]: Without dead ends: 125 [2022-04-08 14:58:54,900 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:54,900 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:54,901 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-08 14:58:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-04-08 14:58:54,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:54,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call 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:54,909 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call 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:54,909 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call 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:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,912 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-08 14:58:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-08 14:58:54,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:54,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:54,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 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 125 states. [2022-04-08 14:58:54,913 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 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 125 states. [2022-04-08 14:58:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:54,916 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-08 14:58:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-08 14:58:54,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:54,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:54,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:54,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call 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:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-04-08 14:58:54,919 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-04-08 14:58:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:54,919 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-04-08 14:58:54,919 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:54,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 163 transitions. [2022-04-08 14:58:55,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-04-08 14:58:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:58:55,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:55,060 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:55,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:58:55,060 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-04-08 14:58:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:55,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1765695946] [2022-04-08 14:58:55,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:55,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 2 times [2022-04-08 14:58:55,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:55,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933235983] [2022-04-08 14:58:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:55,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {2615#(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); {2609#true} is VALID [2022-04-08 14:58:55,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {2609#true} assume true; {2609#true} is VALID [2022-04-08 14:58:55,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2609#true} {2609#true} #149#return; {2609#true} is VALID [2022-04-08 14:58:55,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {2609#true} call ULTIMATE.init(); {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:55,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#(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); {2609#true} is VALID [2022-04-08 14:58:55,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {2609#true} assume true; {2609#true} is VALID [2022-04-08 14:58:55,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2609#true} {2609#true} #149#return; {2609#true} is VALID [2022-04-08 14:58:55,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {2609#true} call #t~ret12 := main(); {2609#true} is VALID [2022-04-08 14:58:55,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {2609#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {2609#true} is VALID [2022-04-08 14:58:55,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {2609#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2609#true} is VALID [2022-04-08 14:58:55,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {2609#true} is VALID [2022-04-08 14:58:55,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {2609#true} assume !(0 != ~p1~0); {2609#true} is VALID [2022-04-08 14:58:55,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {2609#true} assume !(0 != ~p2~0); {2609#true} is VALID [2022-04-08 14:58:55,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {2609#true} assume 0 != ~p3~0;~lk3~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:55,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:55,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:55,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:55,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:55,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:55,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {2614#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:55,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 14:58:55,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2610#false} is VALID [2022-04-08 14:58:55,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {2610#false} assume !false; {2610#false} is VALID [2022-04-08 14:58:55,100 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:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:55,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933235983] [2022-04-08 14:58:55,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933235983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:55,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:55,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:55,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:55,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1765695946] [2022-04-08 14:58:55,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1765695946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:55,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:55,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196328921] [2022-04-08 14:58:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:55,101 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:55,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:55,102 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:55,113 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:55,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:55,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:55,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:55,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:55,114 INFO L87 Difference]: Start difference. First operand 99 states and 163 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:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:55,237 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-04-08 14:58:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:55,238 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:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:55,238 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:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 14:58:55,239 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:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 14:58:55,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-08 14:58:55,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:55,291 INFO L225 Difference]: With dead ends: 179 [2022-04-08 14:58:55,291 INFO L226 Difference]: Without dead ends: 177 [2022-04-08 14:58:55,292 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:55,292 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:55,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-08 14:58:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-04-08 14:58:55,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:55,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,302 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,302 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:55,306 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-08 14:58:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-08 14:58:55,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:55,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:55,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 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 177 states. [2022-04-08 14:58:55,307 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 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 177 states. [2022-04-08 14:58:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:55,312 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-08 14:58:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-08 14:58:55,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:55,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:55,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:55,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-04-08 14:58:55,316 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-04-08 14:58:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:55,316 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-04-08 14:58:55,316 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:55,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 221 transitions. [2022-04-08 14:58:55,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-04-08 14:58:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:58:55,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:55,488 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:55,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:58:55,488 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-04-08 14:58:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:55,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1711745926] [2022-04-08 14:58:55,489 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 2 times [2022-04-08 14:58:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:55,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793463961] [2022-04-08 14:58:55,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:55,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:55,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {3609#(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); {3603#true} is VALID [2022-04-08 14:58:55,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {3603#true} assume true; {3603#true} is VALID [2022-04-08 14:58:55,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3603#true} {3603#true} #149#return; {3603#true} is VALID [2022-04-08 14:58:55,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {3603#true} call ULTIMATE.init(); {3609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:55,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {3609#(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); {3603#true} is VALID [2022-04-08 14:58:55,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {3603#true} assume true; {3603#true} is VALID [2022-04-08 14:58:55,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3603#true} {3603#true} #149#return; {3603#true} is VALID [2022-04-08 14:58:55,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {3603#true} call #t~ret12 := main(); {3603#true} is VALID [2022-04-08 14:58:55,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {3603#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {3603#true} is VALID [2022-04-08 14:58:55,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {3603#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3603#true} is VALID [2022-04-08 14:58:55,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {3603#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {3603#true} is VALID [2022-04-08 14:58:55,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {3603#true} assume !(0 != ~p1~0); {3603#true} is VALID [2022-04-08 14:58:55,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {3603#true} assume !(0 != ~p2~0); {3603#true} is VALID [2022-04-08 14:58:55,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {3603#true} assume !(0 != ~p3~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:55,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:55,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:55,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:55,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:55,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {3608#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:55,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {3608#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-08 14:58:55,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p3~0; {3604#false} is VALID [2022-04-08 14:58:55,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {3604#false} assume 1 != ~lk3~0; {3604#false} is VALID [2022-04-08 14:58:55,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {3604#false} assume !false; {3604#false} is VALID [2022-04-08 14:58:55,521 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:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:55,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793463961] [2022-04-08 14:58:55,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793463961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:55,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:55,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:55,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:55,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1711745926] [2022-04-08 14:58:55,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1711745926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:55,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:55,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940123944] [2022-04-08 14:58:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:55,523 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:55,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:55,523 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:55,533 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:55,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:55,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:55,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:55,533 INFO L87 Difference]: Start difference. First operand 135 states and 221 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:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:55,646 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-04-08 14:58:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:55,646 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:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:55,646 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:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-08 14:58:55,647 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:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-08 14:58:55,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-04-08 14:58:55,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:55,726 INFO L225 Difference]: With dead ends: 311 [2022-04-08 14:58:55,726 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 14:58:55,727 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:55,727 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:55,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 14:58:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-08 14:58:55,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:55,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,738 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,738 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:55,744 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-08 14:58:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-08 14:58:55,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:55,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:55,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 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 185 states. [2022-04-08 14:58:55,745 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 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 185 states. [2022-04-08 14:58:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:55,751 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-08 14:58:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-08 14:58:55,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:55,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:55,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:55,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-04-08 14:58:55,759 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-04-08 14:58:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:55,759 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-04-08 14:58:55,759 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:55,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 295 transitions. [2022-04-08 14:58:56,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-04-08 14:58:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:58:56,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:56,006 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:56,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 14:58:56,006 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-04-08 14:58:56,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:56,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537390307] [2022-04-08 14:58:56,007 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 2 times [2022-04-08 14:58:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:56,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675011614] [2022-04-08 14:58:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:56,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:56,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {4979#(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); {4973#true} is VALID [2022-04-08 14:58:56,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-08 14:58:56,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4973#true} {4973#true} #149#return; {4973#true} is VALID [2022-04-08 14:58:56,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:56,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#(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); {4973#true} is VALID [2022-04-08 14:58:56,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-08 14:58:56,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #149#return; {4973#true} is VALID [2022-04-08 14:58:56,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret12 := main(); {4973#true} is VALID [2022-04-08 14:58:56,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {4973#true} is VALID [2022-04-08 14:58:56,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4973#true} is VALID [2022-04-08 14:58:56,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {4973#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {4973#true} is VALID [2022-04-08 14:58:56,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {4973#true} assume !(0 != ~p1~0); {4973#true} is VALID [2022-04-08 14:58:56,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {4973#true} assume !(0 != ~p2~0); {4973#true} is VALID [2022-04-08 14:58:56,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {4973#true} assume 0 != ~p3~0;~lk3~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:56,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:56,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:56,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:56,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:56,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:56,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:58:56,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4974#false} is VALID [2022-04-08 14:58:56,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {4974#false} assume 0 != ~p4~0; {4974#false} is VALID [2022-04-08 14:58:56,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {4974#false} assume 1 != ~lk4~0; {4974#false} is VALID [2022-04-08 14:58:56,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-08 14:58:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:56,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675011614] [2022-04-08 14:58:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675011614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:56,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:56,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:56,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:56,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537390307] [2022-04-08 14:58:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537390307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:56,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:56,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252669719] [2022-04-08 14:58:56,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:56,039 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:56,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:56,039 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:56,051 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:56,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:56,052 INFO L87 Difference]: Start difference. First operand 183 states and 295 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:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:56,162 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-04-08 14:58:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:56,162 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:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:56,162 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:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 14:58:56,164 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:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 14:58:56,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 14:58:56,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:56,238 INFO L225 Difference]: With dead ends: 277 [2022-04-08 14:58:56,238 INFO L226 Difference]: Without dead ends: 191 [2022-04-08 14:58:56,238 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:56,239 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:56,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-08 14:58:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-04-08 14:58:56,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:56,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call 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:56,250 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call 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:56,250 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call 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:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:56,254 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-08 14:58:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-08 14:58:56,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:56,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:56,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 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 191 states. [2022-04-08 14:58:56,255 INFO L87 Difference]: Start difference. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 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 191 states. [2022-04-08 14:58:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:56,259 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-08 14:58:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-08 14:58:56,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:56,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:56,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:56,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call 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:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-04-08 14:58:56,263 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-04-08 14:58:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:56,264 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-04-08 14:58:56,264 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:56,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 299 transitions. [2022-04-08 14:58:56,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-04-08 14:58:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:58:56,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:56,495 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:56,496 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 14:58:56,496 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-04-08 14:58:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:56,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [750674085] [2022-04-08 14:58:56,497 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 2 times [2022-04-08 14:58:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:56,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833143206] [2022-04-08 14:58:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:56,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:56,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {6305#(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); {6299#true} is VALID [2022-04-08 14:58:56,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {6299#true} assume true; {6299#true} is VALID [2022-04-08 14:58:56,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6299#true} {6299#true} #149#return; {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:56,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#(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); {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #149#return; {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret12 := main(); {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {6299#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {6299#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {6299#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {6299#true} assume !(0 != ~p1~0); {6299#true} is VALID [2022-04-08 14:58:56,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {6299#true} assume !(0 != ~p2~0); {6299#true} is VALID [2022-04-08 14:58:56,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {6299#true} assume !(0 != ~p3~0); {6299#true} is VALID [2022-04-08 14:58:56,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {6299#true} assume 0 != ~p4~0;~lk4~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:56,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:56,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:56,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:56,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:56,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:56,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:56,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p4~0; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 14:58:56,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {6304#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {6300#false} is VALID [2022-04-08 14:58:56,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2022-04-08 14:58:56,542 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:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:56,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833143206] [2022-04-08 14:58:56,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833143206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:56,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:56,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:56,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:56,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [750674085] [2022-04-08 14:58:56,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [750674085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:56,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:56,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036816266] [2022-04-08 14:58:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:56,543 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:56,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:56,543 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:56,556 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:56,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:56,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:56,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:56,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:56,557 INFO L87 Difference]: Start difference. First operand 189 states and 299 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:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:56,685 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-04-08 14:58:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:56,685 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:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:56,685 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:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 14:58:56,686 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:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 14:58:56,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-08 14:58:56,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:56,740 INFO L225 Difference]: With dead ends: 333 [2022-04-08 14:58:56,740 INFO L226 Difference]: Without dead ends: 331 [2022-04-08 14:58:56,740 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:56,742 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:56,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-08 14:58:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-04-08 14:58:56,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:56,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call 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:56,756 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call 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:56,756 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call 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:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:56,761 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-08 14:58:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-08 14:58:56,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:56,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:56,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 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 331 states. [2022-04-08 14:58:56,762 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 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 331 states. [2022-04-08 14:58:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:56,767 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-08 14:58:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-08 14:58:56,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:56,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:56,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:56,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call 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:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-04-08 14:58:56,772 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-04-08 14:58:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:56,773 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-04-08 14:58:56,773 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:56,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 411 transitions. [2022-04-08 14:58:57,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-04-08 14:58:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:58:57,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:57,115 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:57,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 14:58:57,115 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-04-08 14:58:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:57,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705088708] [2022-04-08 14:58:57,116 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 2 times [2022-04-08 14:58:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:57,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935602081] [2022-04-08 14:58:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:57,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:57,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {8175#(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); {8169#true} is VALID [2022-04-08 14:58:57,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-08 14:58:57,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8169#true} {8169#true} #149#return; {8169#true} is VALID [2022-04-08 14:58:57,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:57,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {8175#(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); {8169#true} is VALID [2022-04-08 14:58:57,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-08 14:58:57,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #149#return; {8169#true} is VALID [2022-04-08 14:58:57,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret12 := main(); {8169#true} is VALID [2022-04-08 14:58:57,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {8169#true} is VALID [2022-04-08 14:58:57,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {8169#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {8169#true} is VALID [2022-04-08 14:58:57,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {8169#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {8169#true} is VALID [2022-04-08 14:58:57,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {8169#true} assume !(0 != ~p1~0); {8169#true} is VALID [2022-04-08 14:58:57,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {8169#true} assume !(0 != ~p2~0); {8169#true} is VALID [2022-04-08 14:58:57,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {8169#true} assume !(0 != ~p3~0); {8169#true} is VALID [2022-04-08 14:58:57,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {8169#true} assume !(0 != ~p4~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:57,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:57,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:57,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:57,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p1~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:57,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p2~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:57,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p3~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-08 14:58:57,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p4~0; {8170#false} is VALID [2022-04-08 14:58:57,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume 1 != ~lk4~0; {8170#false} is VALID [2022-04-08 14:58:57,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-08 14:58:57,153 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:57,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:57,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935602081] [2022-04-08 14:58:57,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935602081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:57,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:57,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:57,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:57,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705088708] [2022-04-08 14:58:57,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705088708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:57,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:57,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:57,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586063548] [2022-04-08 14:58:57,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:57,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:57,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:57,154 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:57,167 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:57,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:57,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:57,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:57,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:57,167 INFO L87 Difference]: Start difference. First operand 265 states and 411 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:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:57,321 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-04-08 14:58:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:57,321 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:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:57,321 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:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-08 14:58:57,322 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:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-08 14:58:57,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 129 transitions. [2022-04-08 14:58:57,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:57,397 INFO L225 Difference]: With dead ends: 605 [2022-04-08 14:58:57,397 INFO L226 Difference]: Without dead ends: 355 [2022-04-08 14:58:57,399 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:57,400 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:57,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-08 14:58:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-04-08 14:58:57,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:57,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call 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:57,419 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call 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:57,421 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call 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:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:57,426 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-08 14:58:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-08 14:58:57,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:57,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:57,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 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 355 states. [2022-04-08 14:58:57,427 INFO L87 Difference]: Start difference. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 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 355 states. [2022-04-08 14:58:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:57,433 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-08 14:58:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-08 14:58:57,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:57,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:57,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:57,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call 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:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-04-08 14:58:57,440 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-04-08 14:58:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:57,440 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-04-08 14:58:57,440 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:57,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 353 states and 535 transitions. [2022-04-08 14:58:57,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-04-08 14:58:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:58:57,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:57,862 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:57,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 14:58:57,862 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-04-08 14:58:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:57,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1140523089] [2022-04-08 14:58:57,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 2 times [2022-04-08 14:58:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:57,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543120908] [2022-04-08 14:58:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:57,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {10813#(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); {10807#true} is VALID [2022-04-08 14:58:57,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-08 14:58:57,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10807#true} {10807#true} #149#return; {10807#true} is VALID [2022-04-08 14:58:57,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {10807#true} call ULTIMATE.init(); {10813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:57,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {10813#(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); {10807#true} is VALID [2022-04-08 14:58:57,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-08 14:58:57,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10807#true} {10807#true} #149#return; {10807#true} is VALID [2022-04-08 14:58:57,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {10807#true} call #t~ret12 := main(); {10807#true} is VALID [2022-04-08 14:58:57,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {10807#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {10807#true} is VALID [2022-04-08 14:58:57,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {10807#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {10807#true} is VALID [2022-04-08 14:58:57,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {10807#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {10807#true} is VALID [2022-04-08 14:58:57,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {10807#true} assume !(0 != ~p1~0); {10807#true} is VALID [2022-04-08 14:58:57,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {10807#true} assume !(0 != ~p2~0); {10807#true} is VALID [2022-04-08 14:58:57,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {10807#true} assume !(0 != ~p3~0); {10807#true} is VALID [2022-04-08 14:58:57,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {10807#true} assume 0 != ~p4~0;~lk4~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:57,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:57,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:57,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:57,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:57,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:57,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:58:57,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {10808#false} is VALID [2022-04-08 14:58:57,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {10808#false} assume 0 != ~p5~0; {10808#false} is VALID [2022-04-08 14:58:57,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {10808#false} assume 1 != ~lk5~0; {10808#false} is VALID [2022-04-08 14:58:57,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {10808#false} assume !false; {10808#false} is VALID [2022-04-08 14:58:57,920 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:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:57,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543120908] [2022-04-08 14:58:57,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543120908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:57,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:57,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:57,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:57,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1140523089] [2022-04-08 14:58:57,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1140523089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:57,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:57,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726434887] [2022-04-08 14:58:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:57,921 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:57,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:57,921 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:57,932 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:57,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:57,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:57,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:57,932 INFO L87 Difference]: Start difference. First operand 353 states and 535 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:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:58,041 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-04-08 14:58:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:58,042 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:58,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:58,042 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:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-08 14:58:58,043 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:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-08 14:58:58,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-08 14:58:58,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:58,115 INFO L225 Difference]: With dead ends: 529 [2022-04-08 14:58:58,115 INFO L226 Difference]: Without dead ends: 363 [2022-04-08 14:58:58,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:58:58,116 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:58,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-08 14:58:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-04-08 14:58:58,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:58,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call 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:58,135 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call 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:58,136 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call 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:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:58,141 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-08 14:58:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-08 14:58:58,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:58,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:58,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 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 363 states. [2022-04-08 14:58:58,143 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 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 363 states. [2022-04-08 14:58:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:58,149 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-08 14:58:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-08 14:58:58,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:58,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:58,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:58,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call 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:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-04-08 14:58:58,157 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-04-08 14:58:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:58,157 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-04-08 14:58:58,157 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:58,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 535 transitions. [2022-04-08 14:58:58,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-04-08 14:58:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:58:58,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:58,618 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:58,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 14:58:58,618 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-04-08 14:58:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:58,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444978266] [2022-04-08 14:58:58,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 2 times [2022-04-08 14:58:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:58,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336405708] [2022-04-08 14:58:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:58,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#(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); {13325#true} is VALID [2022-04-08 14:58:58,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {13325#true} assume true; {13325#true} is VALID [2022-04-08 14:58:58,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13325#true} {13325#true} #149#return; {13325#true} is VALID [2022-04-08 14:58:58,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {13325#true} call ULTIMATE.init(); {13331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:58,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#(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); {13325#true} is VALID [2022-04-08 14:58:58,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {13325#true} assume true; {13325#true} is VALID [2022-04-08 14:58:58,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13325#true} {13325#true} #149#return; {13325#true} is VALID [2022-04-08 14:58:58,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {13325#true} call #t~ret12 := main(); {13325#true} is VALID [2022-04-08 14:58:58,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {13325#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {13325#true} is VALID [2022-04-08 14:58:58,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {13325#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {13325#true} is VALID [2022-04-08 14:58:58,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {13325#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {13325#true} is VALID [2022-04-08 14:58:58,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {13325#true} assume !(0 != ~p1~0); {13325#true} is VALID [2022-04-08 14:58:58,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {13325#true} assume !(0 != ~p2~0); {13325#true} is VALID [2022-04-08 14:58:58,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {13325#true} assume !(0 != ~p3~0); {13325#true} is VALID [2022-04-08 14:58:58,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {13325#true} assume !(0 != ~p4~0); {13325#true} is VALID [2022-04-08 14:58:58,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {13325#true} assume 0 != ~p5~0;~lk5~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:58,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:58,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:58,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:58,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:58,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:58,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:58,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p5~0; {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 14:58:58,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {13330#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {13326#false} is VALID [2022-04-08 14:58:58,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {13326#false} assume !false; {13326#false} is VALID [2022-04-08 14:58:58,674 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:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:58,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336405708] [2022-04-08 14:58:58,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336405708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:58,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:58,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:58,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:58,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444978266] [2022-04-08 14:58:58,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444978266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:58,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:58,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114031788] [2022-04-08 14:58:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:58,676 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:58,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:58,676 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:58,687 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:58,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:58,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:58,688 INFO L87 Difference]: Start difference. First operand 361 states and 535 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:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:58,821 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-04-08 14:58:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:58,821 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:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:58,821 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:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-08 14:58:58,822 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:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-08 14:58:58,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-08 14:58:58,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:58,903 INFO L225 Difference]: With dead ends: 621 [2022-04-08 14:58:58,904 INFO L226 Difference]: Without dead ends: 619 [2022-04-08 14:58:58,904 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:58,904 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:58,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-08 14:58:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-04-08 14:58:58,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:58,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call 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:58,932 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call 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:58,933 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call 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:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:58,945 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-08 14:58:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-08 14:58:58,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:58,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:58,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-08 14:58:58,947 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-08 14:58:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:58,960 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-08 14:58:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-08 14:58:58,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:58,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:58,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:58,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call 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:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-04-08 14:58:58,974 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-04-08 14:58:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:58,974 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-04-08 14:58:58,974 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:58,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 751 transitions. [2022-04-08 14:58:59,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 751 edges. 751 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-04-08 14:58:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:58:59,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:59,643 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:59,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 14:58:59,644 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-04-08 14:58:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:59,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679942857] [2022-04-08 14:58:59,644 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 2 times [2022-04-08 14:58:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:59,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771248069] [2022-04-08 14:58:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:59,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {16865#(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); {16859#true} is VALID [2022-04-08 14:58:59,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {16859#true} assume true; {16859#true} is VALID [2022-04-08 14:58:59,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16859#true} {16859#true} #149#return; {16859#true} is VALID [2022-04-08 14:58:59,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {16859#true} call ULTIMATE.init(); {16865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:59,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {16865#(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); {16859#true} is VALID [2022-04-08 14:58:59,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {16859#true} assume true; {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16859#true} {16859#true} #149#return; {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {16859#true} call #t~ret12 := main(); {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {16859#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {16859#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {16859#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {16859#true} assume !(0 != ~p1~0); {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {16859#true} assume !(0 != ~p2~0); {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {16859#true} assume !(0 != ~p3~0); {16859#true} is VALID [2022-04-08 14:58:59,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {16859#true} assume !(0 != ~p4~0); {16859#true} is VALID [2022-04-08 14:58:59,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {16859#true} assume !(0 != ~p5~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:59,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16864#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:59,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16864#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:59,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p1~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:59,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p2~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:59,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p3~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:59,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p4~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 14:58:59,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p5~0; {16860#false} is VALID [2022-04-08 14:58:59,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {16860#false} assume 1 != ~lk5~0; {16860#false} is VALID [2022-04-08 14:58:59,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {16860#false} assume !false; {16860#false} is VALID [2022-04-08 14:58:59,699 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:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771248069] [2022-04-08 14:58:59,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771248069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:59,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:59,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:59,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679942857] [2022-04-08 14:58:59,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679942857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:59,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:59,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82838725] [2022-04-08 14:58:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:59,700 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:59,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:59,700 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:59,711 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:59,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:59,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:59,711 INFO L87 Difference]: Start difference. First operand 521 states and 751 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:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:59,904 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-04-08 14:58:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:59,905 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:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:59,906 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:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-08 14:58:59,907 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:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-08 14:58:59,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-08 14:58:59,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,008 INFO L225 Difference]: With dead ends: 1181 [2022-04-08 14:59:00,009 INFO L226 Difference]: Without dead ends: 683 [2022-04-08 14:59:00,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:00,010 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:00,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-04-08 14:59:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-04-08 14:59:00,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:00,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,047 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,047 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,061 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-08 14:59:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-08 14:59:00,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:00,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:00,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 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 683 states. [2022-04-08 14:59:00,064 INFO L87 Difference]: Start difference. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 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 683 states. [2022-04-08 14:59:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,078 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-08 14:59:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-08 14:59:00,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:00,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:00,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:00,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-04-08 14:59:00,099 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-04-08 14:59:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:00,100 INFO L478 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-04-08 14:59:00,100 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:59:00,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 681 states and 951 transitions. [2022-04-08 14:59:00,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-04-08 14:59:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:59:00,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:00,920 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:00,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 14:59:00,921 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-04-08 14:59:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:00,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775668468] [2022-04-08 14:59:00,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 2 times [2022-04-08 14:59:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:00,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990455588] [2022-04-08 14:59:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:00,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:00,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {21967#(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); {21961#true} is VALID [2022-04-08 14:59:00,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {21961#true} assume true; {21961#true} is VALID [2022-04-08 14:59:00,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21961#true} {21961#true} #149#return; {21961#true} is VALID [2022-04-08 14:59:00,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {21961#true} call ULTIMATE.init(); {21967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:00,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {21967#(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); {21961#true} is VALID [2022-04-08 14:59:00,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {21961#true} assume true; {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21961#true} {21961#true} #149#return; {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {21961#true} call #t~ret12 := main(); {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {21961#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {21961#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {21961#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {21961#true} assume !(0 != ~p1~0); {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {21961#true} assume !(0 != ~p2~0); {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {21961#true} assume !(0 != ~p3~0); {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {21961#true} assume !(0 != ~p4~0); {21961#true} is VALID [2022-04-08 14:59:00,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {21961#true} assume 0 != ~p5~0;~lk5~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:00,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {21966#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:00,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {21966#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:00,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:00,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:00,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:00,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:00,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {21962#false} is VALID [2022-04-08 14:59:00,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {21962#false} assume 0 != ~p6~0; {21962#false} is VALID [2022-04-08 14:59:00,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {21962#false} assume 1 != ~lk6~0; {21962#false} is VALID [2022-04-08 14:59:00,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {21962#false} assume !false; {21962#false} is VALID [2022-04-08 14:59:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:59:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:00,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990455588] [2022-04-08 14:59:00,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990455588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:00,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:00,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:00,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:00,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775668468] [2022-04-08 14:59:00,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775668468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:00,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:00,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663371427] [2022-04-08 14:59:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:59:00,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:00,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:00,964 INFO L87 Difference]: Start difference. First operand 681 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,127 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-04-08 14:59:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:01,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:59:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-08 14:59:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-08 14:59:01,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-04-08 14:59:01,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,214 INFO L225 Difference]: With dead ends: 1021 [2022-04-08 14:59:01,215 INFO L226 Difference]: Without dead ends: 699 [2022-04-08 14:59:01,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:01,216 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:01,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-08 14:59:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-08 14:59:01,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:01,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,257 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,258 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,272 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-08 14:59:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-08 14:59:01,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:01,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:01,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 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 699 states. [2022-04-08 14:59:01,275 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 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 699 states. [2022-04-08 14:59:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,289 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-08 14:59:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-08 14:59:01,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:01,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:01,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:01,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-04-08 14:59:01,311 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-04-08 14:59:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:01,311 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-04-08 14:59:01,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 951 transitions. [2022-04-08 14:59:02,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-04-08 14:59:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:59:02,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:02,137 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:02,137 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 14:59:02,138 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-04-08 14:59:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:02,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106239527] [2022-04-08 14:59:02,138 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 2 times [2022-04-08 14:59:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:02,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135735300] [2022-04-08 14:59:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:02,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:02,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {26813#(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); {26807#true} is VALID [2022-04-08 14:59:02,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {26807#true} assume true; {26807#true} is VALID [2022-04-08 14:59:02,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26807#true} {26807#true} #149#return; {26807#true} is VALID [2022-04-08 14:59:02,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {26807#true} call ULTIMATE.init(); {26813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:02,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {26813#(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); {26807#true} is VALID [2022-04-08 14:59:02,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {26807#true} assume true; {26807#true} is VALID [2022-04-08 14:59:02,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26807#true} {26807#true} #149#return; {26807#true} is VALID [2022-04-08 14:59:02,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {26807#true} call #t~ret12 := main(); {26807#true} is VALID [2022-04-08 14:59:02,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {26807#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {26807#true} is VALID [2022-04-08 14:59:02,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {26807#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {26807#true} is VALID [2022-04-08 14:59:02,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {26807#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {26807#true} is VALID [2022-04-08 14:59:02,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {26807#true} assume !(0 != ~p1~0); {26807#true} is VALID [2022-04-08 14:59:02,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {26807#true} assume !(0 != ~p2~0); {26807#true} is VALID [2022-04-08 14:59:02,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {26807#true} assume !(0 != ~p3~0); {26807#true} is VALID [2022-04-08 14:59:02,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {26807#true} assume !(0 != ~p4~0); {26807#true} is VALID [2022-04-08 14:59:02,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {26807#true} assume !(0 != ~p5~0); {26807#true} is VALID [2022-04-08 14:59:02,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {26807#true} assume 0 != ~p6~0;~lk6~0 := 1; {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:02,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {26812#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:02,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:02,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:02,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:02,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:02,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:02,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {26812#(= main_~lk6~0 1)} assume 0 != ~p6~0; {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:02,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {26812#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {26808#false} is VALID [2022-04-08 14:59:02,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {26808#false} assume !false; {26808#false} is VALID [2022-04-08 14:59:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:59:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:02,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135735300] [2022-04-08 14:59:02,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135735300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:02,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:02,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:02,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:02,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106239527] [2022-04-08 14:59:02,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106239527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:02,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:02,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:02,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003814754] [2022-04-08 14:59:02,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:02,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:59:02,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:02,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:02,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:02,226 INFO L87 Difference]: Start difference. First operand 697 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,447 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-04-08 14:59:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:59:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-08 14:59:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-08 14:59:02,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-08 14:59:02,508 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:59:02,561 INFO L225 Difference]: With dead ends: 1165 [2022-04-08 14:59:02,561 INFO L226 Difference]: Without dead ends: 1163 [2022-04-08 14:59:02,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:02,562 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:02,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-08 14:59:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-04-08 14:59:02,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:02,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,649 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,649 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,684 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-08 14:59:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-08 14:59:02,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:02,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:02,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 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 1163 states. [2022-04-08 14:59:02,687 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 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 1163 states. [2022-04-08 14:59:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,721 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-08 14:59:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-08 14:59:02,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:02,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:02,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:02,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-04-08 14:59:02,767 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-04-08 14:59:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:02,767 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-04-08 14:59:02,767 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1367 transitions. [2022-04-08 14:59:03,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1367 edges. 1367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-04-08 14:59:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:59:03,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:03,958 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:03,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 14:59:03,958 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-04-08 14:59:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:03,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127438930] [2022-04-08 14:59:03,959 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 2 times [2022-04-08 14:59:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:03,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097672319] [2022-04-08 14:59:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:03,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {33547#(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); {33541#true} is VALID [2022-04-08 14:59:03,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {33541#true} assume true; {33541#true} is VALID [2022-04-08 14:59:03,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33541#true} {33541#true} #149#return; {33541#true} is VALID [2022-04-08 14:59:03,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {33541#true} call ULTIMATE.init(); {33547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {33547#(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); {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {33541#true} assume true; {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33541#true} {33541#true} #149#return; {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {33541#true} call #t~ret12 := main(); {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {33541#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {33541#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {33541#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {33541#true} assume !(0 != ~p1~0); {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {33541#true} assume !(0 != ~p2~0); {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {33541#true} assume !(0 != ~p3~0); {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {33541#true} assume !(0 != ~p4~0); {33541#true} is VALID [2022-04-08 14:59:03,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {33541#true} assume !(0 != ~p5~0); {33541#true} is VALID [2022-04-08 14:59:03,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {33541#true} assume !(0 != ~p6~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:03,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {33546#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {33546#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:03,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p1~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:03,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p2~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:03,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p3~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:03,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p4~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:03,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p5~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:03,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {33546#(= main_~p6~0 0)} assume 0 != ~p6~0; {33542#false} is VALID [2022-04-08 14:59:03,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {33542#false} assume 1 != ~lk6~0; {33542#false} is VALID [2022-04-08 14:59:03,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {33542#false} assume !false; {33542#false} is VALID [2022-04-08 14:59:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:59:03,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:03,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097672319] [2022-04-08 14:59:03,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097672319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:03,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:03,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:03,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:03,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127438930] [2022-04-08 14:59:03,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127438930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:03,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:03,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:03,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964954561] [2022-04-08 14:59:03,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:03,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:59:03,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:03,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:04,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:04,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:04,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:04,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:04,001 INFO L87 Difference]: Start difference. First operand 1033 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:04,401 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-04-08 14:59:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:04,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:59:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:04,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 14:59:04,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 14:59:04,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 14:59:04,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:04,550 INFO L225 Difference]: With dead ends: 2317 [2022-04-08 14:59:04,550 INFO L226 Difference]: Without dead ends: 1323 [2022-04-08 14:59:04,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:04,552 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:04,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-04-08 14:59:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-04-08 14:59:04,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:04,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,626 INFO L74 IsIncluded]: Start isIncluded. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,627 INFO L87 Difference]: Start difference. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:04,669 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-08 14:59:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-08 14:59:04,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:04,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:04,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 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 1323 states. [2022-04-08 14:59:04,672 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 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 1323 states. [2022-04-08 14:59:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:04,729 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-08 14:59:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-08 14:59:04,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:04,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:04,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:04,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-04-08 14:59:04,794 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-04-08 14:59:04,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:04,795 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-04-08 14:59:04,795 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1321 states and 1671 transitions. [2022-04-08 14:59:06,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-04-08 14:59:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:59:06,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:06,312 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:06,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 14:59:06,312 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-04-08 14:59:06,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:06,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617385194] [2022-04-08 14:59:06,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:06,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 2 times [2022-04-08 14:59:06,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:06,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121361335] [2022-04-08 14:59:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:06,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:06,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {43481#(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); {43475#true} is VALID [2022-04-08 14:59:06,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {43475#true} assume true; {43475#true} is VALID [2022-04-08 14:59:06,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43475#true} {43475#true} #149#return; {43475#true} is VALID [2022-04-08 14:59:06,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {43475#true} call ULTIMATE.init(); {43481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:06,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {43481#(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); {43475#true} is VALID [2022-04-08 14:59:06,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {43475#true} assume true; {43475#true} is VALID [2022-04-08 14:59:06,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43475#true} {43475#true} #149#return; {43475#true} is VALID [2022-04-08 14:59:06,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {43475#true} call #t~ret12 := main(); {43475#true} is VALID [2022-04-08 14:59:06,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {43475#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {43475#true} is VALID [2022-04-08 14:59:06,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {43475#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {43475#true} is VALID [2022-04-08 14:59:06,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {43475#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {43475#true} is VALID [2022-04-08 14:59:06,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {43475#true} assume !(0 != ~p1~0); {43475#true} is VALID [2022-04-08 14:59:06,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {43475#true} assume !(0 != ~p2~0); {43475#true} is VALID [2022-04-08 14:59:06,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {43475#true} assume !(0 != ~p3~0); {43475#true} is VALID [2022-04-08 14:59:06,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {43475#true} assume !(0 != ~p4~0); {43475#true} is VALID [2022-04-08 14:59:06,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {43475#true} assume !(0 != ~p5~0); {43475#true} is VALID [2022-04-08 14:59:06,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {43475#true} assume 0 != ~p6~0;~lk6~0 := 1; {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:06,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {43480#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:06,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:06,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:06,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:06,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:06,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:06,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {43476#false} is VALID [2022-04-08 14:59:06,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {43476#false} assume 0 != ~p7~0; {43476#false} is VALID [2022-04-08 14:59:06,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {43476#false} assume 1 != ~lk7~0; {43476#false} is VALID [2022-04-08 14:59:06,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {43476#false} assume !false; {43476#false} is VALID [2022-04-08 14:59:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:59:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:06,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121361335] [2022-04-08 14:59:06,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121361335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:06,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:06,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:06,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:06,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617385194] [2022-04-08 14:59:06,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617385194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:06,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:06,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766473443] [2022-04-08 14:59:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:06,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:59:06,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:06,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:06,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:06,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:06,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:06,390 INFO L87 Difference]: Start difference. First operand 1321 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:06,713 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-04-08 14:59:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:06,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:59:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 14:59:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 14:59:06,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-08 14:59:06,786 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:59:06,852 INFO L225 Difference]: With dead ends: 1981 [2022-04-08 14:59:06,852 INFO L226 Difference]: Without dead ends: 1355 [2022-04-08 14:59:06,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:06,854 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 68 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:59:06,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-08 14:59:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-08 14:59:06,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:06,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,969 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,970 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:07,014 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-08 14:59:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-08 14:59:07,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:07,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:07,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 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 1355 states. [2022-04-08 14:59:07,018 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 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 1355 states. [2022-04-08 14:59:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:07,061 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-08 14:59:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-08 14:59:07,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:07,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:07,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:07,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-04-08 14:59:07,134 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-04-08 14:59:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:07,134 INFO L478 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-04-08 14:59:07,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:07,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 1671 transitions. [2022-04-08 14:59:08,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-04-08 14:59:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:59:08,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:08,604 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:08,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 14:59:08,604 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-04-08 14:59:08,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:08,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752393515] [2022-04-08 14:59:08,605 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:08,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 2 times [2022-04-08 14:59:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:08,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267990021] [2022-04-08 14:59:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:08,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {52871#(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); {52865#true} is VALID [2022-04-08 14:59:08,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {52865#true} assume true; {52865#true} is VALID [2022-04-08 14:59:08,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52865#true} {52865#true} #149#return; {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {52865#true} call ULTIMATE.init(); {52871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {52871#(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); {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {52865#true} assume true; {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52865#true} {52865#true} #149#return; {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {52865#true} call #t~ret12 := main(); {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {52865#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {52865#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {52865#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {52865#true} assume !(0 != ~p1~0); {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {52865#true} assume !(0 != ~p2~0); {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {52865#true} assume !(0 != ~p3~0); {52865#true} is VALID [2022-04-08 14:59:08,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {52865#true} assume !(0 != ~p4~0); {52865#true} is VALID [2022-04-08 14:59:08,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {52865#true} assume !(0 != ~p5~0); {52865#true} is VALID [2022-04-08 14:59:08,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {52865#true} assume !(0 != ~p6~0); {52865#true} is VALID [2022-04-08 14:59:08,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {52865#true} assume 0 != ~p7~0;~lk7~0 := 1; {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:08,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:08,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:08,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:08,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:08,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:08,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:08,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {52870#(= main_~lk7~0 1)} assume 0 != ~p7~0; {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:08,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {52870#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {52866#false} is VALID [2022-04-08 14:59:08,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {52866#false} assume !false; {52866#false} is VALID [2022-04-08 14:59:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:59:08,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:08,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267990021] [2022-04-08 14:59:08,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267990021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:08,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:08,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:08,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:08,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752393515] [2022-04-08 14:59:08,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752393515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:08,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:08,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647680221] [2022-04-08 14:59:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:08,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:59:08,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:08,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:08,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:08,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:08,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:08,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:08,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:08,650 INFO L87 Difference]: Start difference. First operand 1353 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:09,081 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-04-08 14:59:09,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:09,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:59:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 14:59:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 14:59:09,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-08 14:59:09,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:09,319 INFO L225 Difference]: With dead ends: 2187 [2022-04-08 14:59:09,319 INFO L226 Difference]: Without dead ends: 2185 [2022-04-08 14:59:09,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:09,320 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:09,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-04-08 14:59:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-04-08 14:59:09,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:09,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,458 INFO L74 IsIncluded]: Start isIncluded. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,459 INFO L87 Difference]: Start difference. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:09,571 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-08 14:59:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-08 14:59:09,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:09,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:09,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 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 2185 states. [2022-04-08 14:59:09,577 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 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 2185 states. [2022-04-08 14:59:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:09,690 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-08 14:59:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-08 14:59:09,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:09,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:09,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:09,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-04-08 14:59:09,901 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-04-08 14:59:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:09,901 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-04-08 14:59:09,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 2471 transitions. [2022-04-08 14:59:12,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2471 edges. 2471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-04-08 14:59:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:59:12,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:12,123 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:12,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 14:59:12,123 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-04-08 14:59:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:12,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2047149606] [2022-04-08 14:59:12,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 2 times [2022-04-08 14:59:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:12,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479672213] [2022-04-08 14:59:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:12,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {65741#(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); {65735#true} is VALID [2022-04-08 14:59:12,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {65735#true} assume true; {65735#true} is VALID [2022-04-08 14:59:12,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65735#true} {65735#true} #149#return; {65735#true} is VALID [2022-04-08 14:59:12,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {65735#true} call ULTIMATE.init(); {65741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:12,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {65741#(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); {65735#true} is VALID [2022-04-08 14:59:12,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {65735#true} assume true; {65735#true} is VALID [2022-04-08 14:59:12,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65735#true} {65735#true} #149#return; {65735#true} is VALID [2022-04-08 14:59:12,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {65735#true} call #t~ret12 := main(); {65735#true} is VALID [2022-04-08 14:59:12,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {65735#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {65735#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {65735#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {65735#true} assume !(0 != ~p1~0); {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {65735#true} assume !(0 != ~p2~0); {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {65735#true} assume !(0 != ~p3~0); {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {65735#true} assume !(0 != ~p4~0); {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {65735#true} assume !(0 != ~p5~0); {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {65735#true} assume !(0 != ~p6~0); {65735#true} is VALID [2022-04-08 14:59:12,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {65735#true} assume !(0 != ~p7~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:12,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p1~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:12,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p2~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:12,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p3~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:12,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p4~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:12,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p5~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:12,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p6~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:12,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {65740#(= main_~p7~0 0)} assume 0 != ~p7~0; {65736#false} is VALID [2022-04-08 14:59:12,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {65736#false} assume 1 != ~lk7~0; {65736#false} is VALID [2022-04-08 14:59:12,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {65736#false} assume !false; {65736#false} is VALID [2022-04-08 14:59:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:59:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479672213] [2022-04-08 14:59:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479672213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:12,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:12,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:12,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2047149606] [2022-04-08 14:59:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2047149606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:12,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:12,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027429756] [2022-04-08 14:59:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:12,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:59:12,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:12,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:12,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:12,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:12,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:12,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:12,177 INFO L87 Difference]: Start difference. First operand 2057 states and 2471 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:13,276 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-04-08 14:59:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:13,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:59:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 14:59:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 14:59:13,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-08 14:59:13,342 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:59:13,342 INFO L225 Difference]: With dead ends: 4553 [2022-04-08 14:59:13,342 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:59:13,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:13,347 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:13,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:59:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:59:13,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:13,348 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:59:13,348 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:59:13,348 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:59:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:13,348 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:59:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:59:13,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:13,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:13,348 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:59:13,348 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:59:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:13,349 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:59:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:59:13,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:13,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:13,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:13,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:13,349 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:59:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:59:13,349 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-08 14:59:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:13,349 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:59:13,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:13,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:59:13,349 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:59:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:59:13,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:13,351 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:59:13,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 14:59:13,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:59:41,679 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 14:59:41,679 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 14:59:41,679 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 14:59:41,680 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:59:41,680 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:59:41,680 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:59:41,680 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:59:41,680 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 14:59:41,680 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:59:41,680 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:59:41,681 INFO L878 garLoopResultBuilder]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse2 (= main_~p7~0 0)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse5 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse2 .cse7 .cse6) (and .cse4 .cse0 .cse1 .cse6) (and .cse5 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse6) (and .cse4 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse1 .cse2 .cse7 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse5 .cse0 .cse2 .cse6) (and .cse4 .cse1 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse6))) [2022-04-08 14:59:41,681 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2022-04-08 14:59:41,682 INFO L878 garLoopResultBuilder]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-08 14:59:41,682 INFO L878 garLoopResultBuilder]: At program point L69-1(lines 32 118) 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:59:41,682 INFO L878 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse6 (= main_~p7~0 0)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse9 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse5) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5))) [2022-04-08 14:59:41,682 INFO L878 garLoopResultBuilder]: At program point L61-1(lines 32 118) 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:59:41,682 INFO L885 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-04-08 14:59:41,682 INFO L885 garLoopResultBuilder]: At program point L53(lines 53 55) the Hoare annotation is: true [2022-04-08 14:59:41,683 INFO L878 garLoopResultBuilder]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-08 14:59:41,683 INFO L878 garLoopResultBuilder]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) [2022-04-08 14:59:41,683 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2022-04-08 14:59:41,683 INFO L878 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse2 (= main_~lk5~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5))) [2022-04-08 14:59:41,683 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2022-04-08 14:59:41,683 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-04-08 14:59:41,684 INFO L878 garLoopResultBuilder]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse8 .cse6 .cse3 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse7) (and .cse0 .cse2 .cse5 .cse7 .cse4) (and .cse0 .cse1 .cse9 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse3) (and .cse2 .cse5 .cse8 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse7 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse8 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse3 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse3) (and .cse5 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse9 .cse3) (and .cse1 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse8 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse9 .cse7) (and .cse5 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse7) (and .cse0 .cse1 .cse9 .cse6 .cse7) (and .cse2 .cse5 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse3 .cse4) (and .cse1 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse5 .cse3 .cse4))) [2022-04-08 14:59:41,684 INFO L885 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-04-08 14:59:41,684 INFO L878 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse9 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse10 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse10 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5) (and .cse6 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse6 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse6 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse10 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4 .cse9 .cse5) (and .cse0 .cse7 .cse1 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse10 .cse9 .cse5) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse10 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse9 .cse5))) [2022-04-08 14:59:41,684 INFO L878 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2022-04-08 14:59:41,684 INFO L878 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-04-08 14:59:41,684 INFO L878 garLoopResultBuilder]: At program point L73-1(lines 32 118) 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:59:41,684 INFO L878 garLoopResultBuilder]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse3 (= main_~lk7~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse5 .cse2) (and .cse3 .cse0 .cse2) (and .cse0 .cse1 .cse4))) [2022-04-08 14:59:41,684 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 32 118) 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:59:41,684 INFO L878 garLoopResultBuilder]: At program point L57-1(lines 32 118) 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:59:41,685 INFO L878 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (= main_~p6~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse5 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse0 .cse1 .cse2 .cse4) (and .cse6 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse7) (and .cse6 .cse1 .cse2 .cse5 .cse7))) [2022-04-08 14:59:41,685 INFO L878 garLoopResultBuilder]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse4 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse11 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse9 .cse1 .cse7 .cse11 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse6 .cse9 .cse7 .cse4 .cse8) (and .cse6 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse11) (and .cse6 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse11 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse4 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse4 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse11) (and .cse1 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse11 .cse8 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse8) (and .cse9 .cse1 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse4))) [2022-04-08 14:59:41,685 INFO L878 garLoopResultBuilder]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~lk7~0 1) (= main_~p7~0 0)) [2022-04-08 14:59:41,686 INFO L885 garLoopResultBuilder]: At program point L34(lines 34 36) the Hoare annotation is: true [2022-04-08 14:59:41,686 INFO L878 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse13 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse12 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse7 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse7 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse11 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse11 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse7 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse11) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse11 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse7 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12))) [2022-04-08 14:59:41,686 INFO L878 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (not (= main_~p6~0 0)))) (or (and (= main_~lk7~0 1) .cse0 .cse1) (and (= main_~p7~0 0) .cse0 .cse1))) [2022-04-08 14:59:41,688 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 14:59:41,689 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:59:41,691 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:59:41,692 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:59:41,742 INFO L163 areAnnotationChecker]: CFG has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:59:41,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:59:41 BoogieIcfgContainer [2022-04-08 14:59:41,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:59:41,749 INFO L158 Benchmark]: Toolchain (without parser) took 49841.41ms. Allocated memory was 186.6MB in the beginning and 679.5MB in the end (delta: 492.8MB). Free memory was 136.9MB in the beginning and 449.5MB in the end (delta: -312.6MB). Peak memory consumption was 394.8MB. Max. memory is 8.0GB. [2022-04-08 14:59:41,749 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:59:41,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.54ms. Allocated memory is still 186.6MB. Free memory was 136.7MB in the beginning and 162.2MB in the end (delta: -25.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 14:59:41,754 INFO L158 Benchmark]: Boogie Preprocessor took 36.29ms. Allocated memory is still 186.6MB. Free memory was 162.2MB in the beginning and 160.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 14:59:41,754 INFO L158 Benchmark]: RCFGBuilder took 284.27ms. Allocated memory is still 186.6MB. Free memory was 160.4MB in the beginning and 147.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 14:59:41,755 INFO L158 Benchmark]: TraceAbstraction took 49269.90ms. Allocated memory was 186.6MB in the beginning and 679.5MB in the end (delta: 492.8MB). Free memory was 147.0MB in the beginning and 449.5MB in the end (delta: -302.5MB). Peak memory consumption was 404.8MB. Max. memory is 8.0GB. [2022-04-08 14:59:41,755 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 186.6MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.54ms. Allocated memory is still 186.6MB. Free memory was 136.7MB in the beginning and 162.2MB in the end (delta: -25.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.29ms. Allocated memory is still 186.6MB. Free memory was 162.2MB in the beginning and 160.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 284.27ms. Allocated memory is still 186.6MB. Free memory was 160.4MB in the beginning and 147.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 49269.90ms. Allocated memory was 186.6MB in the beginning and 679.5MB in the end (delta: 492.8MB). Free memory was 147.0MB in the beginning and 449.5MB in the end (delta: -302.5MB). Peak memory consumption was 404.8MB. 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: 121]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1206 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 2605 NumberOfFragments, 9766 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 11.9s HoareSimplificationTime, 36 FomulaSimplificationsInter, 148195 FormulaSimplificationTreeSizeReductionInter, 16.3s 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: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - 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:59:41,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...