/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:01:14,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:01:14,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:01:15,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:01:15,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:01:15,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:01:15,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:01:15,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:01:15,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:01:15,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:01:15,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:01:15,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:01:15,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:01:15,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:01:15,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:01:15,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:01:15,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:01:15,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:01:15,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:01:15,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:01:15,074 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:01:15,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:01:15,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:01:15,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:01:15,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:01:15,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:01:15,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:01:15,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:01:15,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:01:15,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:01:15,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:01:15,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:01:15,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:01:15,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:01:15,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:01:15,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:01:15,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:01:15,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:01:15,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:01:15,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:01:15,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:01:15,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:01:15,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:01:15,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:01:15,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:01:15,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:01:15,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:01:15,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:01:15,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:01:15,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:01:15,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:01:15,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:01:15,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:01:15,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:01:15,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:01:15,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:01:15,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:01:15,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:01:15,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:15,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:01:15,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:01:15,107 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:01:15,107 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:01:15,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:01:15,107 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:01:15,108 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-28 15:01:15,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:01:15,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:01:15,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:01:15,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:01:15,352 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:01:15,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-04-28 15:01:15,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc40e681/6eacbc3f1a2546eaa6f307a3220fe0c1/FLAG4fa1f65dc [2022-04-28 15:01:15,754 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:01:15,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-04-28 15:01:15,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc40e681/6eacbc3f1a2546eaa6f307a3220fe0c1/FLAG4fa1f65dc [2022-04-28 15:01:15,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc40e681/6eacbc3f1a2546eaa6f307a3220fe0c1 [2022-04-28 15:01:15,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:01:15,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:01:15,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:15,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:01:15,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:01:15,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:15" (1/1) ... [2022-04-28 15:01:15,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b4c050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:15, skipping insertion in model container [2022-04-28 15:01:15,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:15" (1/1) ... [2022-04-28 15:01:15,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:01:15,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:01:15,964 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_5.c[2207,2220] [2022-04-28 15:01:15,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:15,974 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:01:16,014 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_5.c[2207,2220] [2022-04-28 15:01:16,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:16,032 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:01:16,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16 WrapperNode [2022-04-28 15:01:16,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:16,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:01:16,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:01:16,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:01:16,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (1/1) ... [2022-04-28 15:01:16,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (1/1) ... [2022-04-28 15:01:16,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (1/1) ... [2022-04-28 15:01:16,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (1/1) ... [2022-04-28 15:01:16,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (1/1) ... [2022-04-28 15:01:16,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (1/1) ... [2022-04-28 15:01:16,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (1/1) ... [2022-04-28 15:01:16,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:01:16,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:01:16,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:01:16,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:01:16,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (1/1) ... [2022-04-28 15:01:16,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:16,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:01:16,104 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-28 15:01:16,118 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-28 15:01:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:01:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:01:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:01:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:01:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:01:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:01:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:01:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:01:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:01:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:01:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:01:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:01:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:01:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:01:16,195 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:01:16,196 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:01:16,335 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:01:16,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:01:16,342 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:01:16,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:16 BoogieIcfgContainer [2022-04-28 15:01:16,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:01:16,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:01:16,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:01:16,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:01:16,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:01:15" (1/3) ... [2022-04-28 15:01:16,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ae425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:16, skipping insertion in model container [2022-04-28 15:01:16,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:16" (2/3) ... [2022-04-28 15:01:16,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ae425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:16, skipping insertion in model container [2022-04-28 15:01:16,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:16" (3/3) ... [2022-04-28 15:01:16,365 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-04-28 15:01:16,378 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:01:16,379 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:01:16,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:01:16,441 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a1ed5f2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1812b404 [2022-04-28 15:01:16,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:01:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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-28 15:01:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 15:01:16,455 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:16,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:16,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-04-28 15:01:16,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:16,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564440219] [2022-04-28 15:01:16,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 2 times [2022-04-28 15:01:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:16,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791640794] [2022-04-28 15:01:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:16,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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); {33#true} is VALID [2022-04-28 15:01:16,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 15:01:16,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-28 15:01:16,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:16,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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); {33#true} is VALID [2022-04-28 15:01:16,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 15:01:16,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-28 15:01:16,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret10 := main(); {33#true} is VALID [2022-04-28 15:01:16,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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;havoc ~cond~0; {33#true} is VALID [2022-04-28 15:01:16,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {33#true} is VALID [2022-04-28 15:01:16,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {33#true} is VALID [2022-04-28 15:01:16,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 != ~p1~0;~lk1~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:16,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {38#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:16,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:16,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:16,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:16,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p1~0; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:16,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {34#false} is VALID [2022-04-28 15:01:16,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 15:01:16,725 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-28 15:01:16,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:16,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791640794] [2022-04-28 15:01:16,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791640794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:16,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:16,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:16,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:16,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564440219] [2022-04-28 15:01:16,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564440219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:16,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:16,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:16,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887777098] [2022-04-28 15:01:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:16,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-04-28 15:01:16,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:16,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:16,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:16,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:16,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:16,802 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:17,109 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-04-28 15:01:17,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:17,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-04-28 15:01:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 15:01:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 15:01:17,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 15:01:17,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:17,244 INFO L225 Difference]: With dead ends: 58 [2022-04-28 15:01:17,244 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 15:01:17,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:17,250 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:17,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:01:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 15:01:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-28 15:01:17,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:17,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,280 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,280 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:17,284 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-28 15:01:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-28 15:01:17,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:17,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:17,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 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 43 states. [2022-04-28 15:01:17,285 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 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 43 states. [2022-04-28 15:01:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:17,288 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-28 15:01:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-28 15:01:17,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:17,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:17,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:17,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-28 15:01:17,292 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-04-28 15:01:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:17,293 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-04-28 15:01:17,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 50 transitions. [2022-04-28 15:01:17,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-04-28 15:01:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 15:01:17,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:17,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:17,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:01:17,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-04-28 15:01:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:17,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537825449] [2022-04-28 15:01:17,395 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 2 times [2022-04-28 15:01:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:17,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146341452] [2022-04-28 15:01:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:17,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {315#(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); {309#true} is VALID [2022-04-28 15:01:17,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 15:01:17,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #115#return; {309#true} is VALID [2022-04-28 15:01:17,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:17,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#(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); {309#true} is VALID [2022-04-28 15:01:17,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 15:01:17,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #115#return; {309#true} is VALID [2022-04-28 15:01:17,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret10 := main(); {309#true} is VALID [2022-04-28 15:01:17,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#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;havoc ~cond~0; {309#true} is VALID [2022-04-28 15:01:17,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {309#true} is VALID [2022-04-28 15:01:17,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {309#true} is VALID [2022-04-28 15:01:17,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} assume !(0 != ~p1~0); {314#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:17,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(= main_~p1~0 0)} assume !(0 != ~p2~0); {314#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:17,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:17,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:17,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:17,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p1~0; {310#false} is VALID [2022-04-28 15:01:17,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {310#false} assume 1 != ~lk1~0; {310#false} is VALID [2022-04-28 15:01:17,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-28 15:01:17,458 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-28 15:01:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:17,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146341452] [2022-04-28 15:01:17,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146341452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:17,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:17,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:17,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:17,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537825449] [2022-04-28 15:01:17,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537825449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:17,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976558737] [2022-04-28 15:01:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-04-28 15:01:17,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:17,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:17,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:17,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:17,475 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:17,591 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-04-28 15:01:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-04-28 15:01:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-28 15:01:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-28 15:01:17,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-28 15:01:17,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:17,681 INFO L225 Difference]: With dead ends: 68 [2022-04-28 15:01:17,681 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 15:01:17,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:17,683 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:17,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 15:01:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-04-28 15:01:17,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:17,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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-28 15:01:17,692 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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-28 15:01:17,693 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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-28 15:01:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:17,695 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-28 15:01:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-28 15:01:17,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:17,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:17,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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 43 states. [2022-04-28 15:01:17,696 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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 43 states. [2022-04-28 15:01:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:17,698 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-28 15:01:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-28 15:01:17,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:17,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:17,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:17,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 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-28 15:01:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-04-28 15:01:17,701 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-04-28 15:01:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:17,701 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-04-28 15:01:17,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 66 transitions. [2022-04-28 15:01:17,763 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-28 15:01:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-04-28 15:01:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 15:01:17,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:17,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:17,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:01:17,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:17,766 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-04-28 15:01:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:17,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1786402931] [2022-04-28 15:01:17,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 2 times [2022-04-28 15:01:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:17,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084766943] [2022-04-28 15:01:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:17,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(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); {625#true} is VALID [2022-04-28 15:01:17,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 15:01:17,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #115#return; {625#true} is VALID [2022-04-28 15:01:17,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:17,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(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); {625#true} is VALID [2022-04-28 15:01:17,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 15:01:17,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #115#return; {625#true} is VALID [2022-04-28 15:01:17,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret10 := main(); {625#true} is VALID [2022-04-28 15:01:17,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#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;havoc ~cond~0; {625#true} is VALID [2022-04-28 15:01:17,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {625#true} is VALID [2022-04-28 15:01:17,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {625#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {625#true} is VALID [2022-04-28 15:01:17,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#true} assume 0 != ~p1~0;~lk1~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:17,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {630#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:17,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:17,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:17,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:17,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {626#false} is VALID [2022-04-28 15:01:17,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#false} assume 0 != ~p2~0; {626#false} is VALID [2022-04-28 15:01:17,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#false} assume 1 != ~lk2~0; {626#false} is VALID [2022-04-28 15:01:17,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-28 15:01:17,825 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-28 15:01:17,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:17,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084766943] [2022-04-28 15:01:17,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084766943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:17,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:17,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:17,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:17,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1786402931] [2022-04-28 15:01:17,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1786402931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:17,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:17,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:17,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083526815] [2022-04-28 15:01:17,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:17,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:17,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:17,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:17,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:17,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:17,842 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:17,946 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-28 15:01:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:17,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-28 15:01:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-28 15:01:17,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-28 15:01:18,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:18,037 INFO L225 Difference]: With dead ends: 64 [2022-04-28 15:01:18,037 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 15:01:18,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:18,039 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:18,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 15:01:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-28 15:01:18,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:18,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,046 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,047 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,049 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-28 15:01:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-28 15:01:18,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:18,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:18,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 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 46 states. [2022-04-28 15:01:18,050 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 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 46 states. [2022-04-28 15:01:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,052 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-28 15:01:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-28 15:01:18,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:18,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:18,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:18,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-04-28 15:01:18,054 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-04-28 15:01:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:18,054 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-04-28 15:01:18,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 68 transitions. [2022-04-28 15:01:18,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-04-28 15:01:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 15:01:18,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:18,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:18,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:01:18,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-04-28 15:01:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:18,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688246615] [2022-04-28 15:01:18,137 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:18,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 2 times [2022-04-28 15:01:18,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:18,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971538592] [2022-04-28 15:01:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:18,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {951#(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); {945#true} is VALID [2022-04-28 15:01:18,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} assume true; {945#true} is VALID [2022-04-28 15:01:18,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {945#true} {945#true} #115#return; {945#true} is VALID [2022-04-28 15:01:18,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {945#true} call ULTIMATE.init(); {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:18,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#(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); {945#true} is VALID [2022-04-28 15:01:18,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} assume true; {945#true} is VALID [2022-04-28 15:01:18,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} #115#return; {945#true} is VALID [2022-04-28 15:01:18,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {945#true} call #t~ret10 := main(); {945#true} is VALID [2022-04-28 15:01:18,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {945#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;havoc ~cond~0; {945#true} is VALID [2022-04-28 15:01:18,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {945#true} is VALID [2022-04-28 15:01:18,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {945#true} is VALID [2022-04-28 15:01:18,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#true} assume !(0 != ~p1~0); {945#true} is VALID [2022-04-28 15:01:18,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#true} assume !(0 != ~p2~0); {950#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:18,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:18,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:18,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:18,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= main_~p2~0 0)} assume !(0 != ~p1~0); {950#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:18,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p2~0; {946#false} is VALID [2022-04-28 15:01:18,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#false} assume 1 != ~lk2~0; {946#false} is VALID [2022-04-28 15:01:18,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#false} assume !false; {946#false} is VALID [2022-04-28 15:01:18,202 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-28 15:01:18,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:18,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971538592] [2022-04-28 15:01:18,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971538592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:18,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:18,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:18,203 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:18,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688246615] [2022-04-28 15:01:18,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688246615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:18,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:18,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623152545] [2022-04-28 15:01:18,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:18,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:18,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:18,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:18,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:18,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:18,220 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,343 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-04-28 15:01:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:18,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 15:01:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 15:01:18,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-28 15:01:18,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:18,449 INFO L225 Difference]: With dead ends: 112 [2022-04-28 15:01:18,449 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 15:01:18,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:18,451 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:18,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 15:01:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-28 15:01:18,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:18,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,462 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,463 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,465 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-28 15:01:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-28 15:01:18,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:18,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:18,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 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 77 states. [2022-04-28 15:01:18,467 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 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 77 states. [2022-04-28 15:01:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,470 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-28 15:01:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-28 15:01:18,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:18,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:18,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:18,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-04-28 15:01:18,474 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-04-28 15:01:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:18,474 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-04-28 15:01:18,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 117 transitions. [2022-04-28 15:01:18,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-04-28 15:01:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 15:01:18,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:18,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:18,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:01:18,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-04-28 15:01:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:18,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050972060] [2022-04-28 15:01:18,578 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 2 times [2022-04-28 15:01:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:18,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688713924] [2022-04-28 15:01:18,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:18,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {1491#(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); {1485#true} is VALID [2022-04-28 15:01:18,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-28 15:01:18,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1485#true} {1485#true} #115#return; {1485#true} is VALID [2022-04-28 15:01:18,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {1485#true} call ULTIMATE.init(); {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:18,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#(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); {1485#true} is VALID [2022-04-28 15:01:18,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-28 15:01:18,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1485#true} {1485#true} #115#return; {1485#true} is VALID [2022-04-28 15:01:18,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {1485#true} call #t~ret10 := main(); {1485#true} is VALID [2022-04-28 15:01:18,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {1485#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;havoc ~cond~0; {1485#true} is VALID [2022-04-28 15:01:18,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {1485#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1485#true} is VALID [2022-04-28 15:01:18,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {1485#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1485#true} is VALID [2022-04-28 15:01:18,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {1485#true} assume !(0 != ~p1~0); {1485#true} is VALID [2022-04-28 15:01:18,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {1485#true} assume 0 != ~p2~0;~lk2~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:18,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:18,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:18,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:18,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {1490#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:18,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:18,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {1490#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1486#false} is VALID [2022-04-28 15:01:18,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {1486#false} assume !false; {1486#false} is VALID [2022-04-28 15:01:18,624 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-28 15:01:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:18,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688713924] [2022-04-28 15:01:18,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688713924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:18,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:18,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:18,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:18,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050972060] [2022-04-28 15:01:18,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050972060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:18,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:18,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247563450] [2022-04-28 15:01:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:18,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:18,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:18,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:18,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:18,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:18,639 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,785 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-04-28 15:01:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 15:01:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 15:01:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 15:01:18,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-28 15:01:18,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:18,838 INFO L225 Difference]: With dead ends: 95 [2022-04-28 15:01:18,838 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 15:01:18,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:18,839 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:18,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 15:01:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-04-28 15:01:18,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:18,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,850 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,850 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,853 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-28 15:01:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-28 15:01:18,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:18,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:18,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 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 93 states. [2022-04-28 15:01:18,854 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 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 93 states. [2022-04-28 15:01:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:18,857 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-28 15:01:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-28 15:01:18,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:18,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:18,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:18,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-04-28 15:01:18,861 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-04-28 15:01:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:18,861 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-04-28 15:01:18,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:18,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 115 transitions. [2022-04-28 15:01:18,971 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-28 15:01:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-04-28 15:01:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 15:01:18,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:18,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:18,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:01:18,973 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:18,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-04-28 15:01:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:18,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377809225] [2022-04-28 15:01:18,974 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 2 times [2022-04-28 15:01:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:18,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13503845] [2022-04-28 15:01:18,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:19,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {2029#(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); {2023#true} is VALID [2022-04-28 15:01:19,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {2023#true} assume true; {2023#true} is VALID [2022-04-28 15:01:19,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2023#true} {2023#true} #115#return; {2023#true} is VALID [2022-04-28 15:01:19,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {2023#true} call ULTIMATE.init(); {2029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:19,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {2029#(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); {2023#true} is VALID [2022-04-28 15:01:19,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {2023#true} assume true; {2023#true} is VALID [2022-04-28 15:01:19,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2023#true} {2023#true} #115#return; {2023#true} is VALID [2022-04-28 15:01:19,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {2023#true} call #t~ret10 := main(); {2023#true} is VALID [2022-04-28 15:01:19,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {2023#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;havoc ~cond~0; {2023#true} is VALID [2022-04-28 15:01:19,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {2023#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2023#true} is VALID [2022-04-28 15:01:19,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {2023#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2023#true} is VALID [2022-04-28 15:01:19,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {2023#true} assume !(0 != ~p1~0); {2023#true} is VALID [2022-04-28 15:01:19,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {2023#true} assume !(0 != ~p2~0); {2023#true} is VALID [2022-04-28 15:01:19,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {2023#true} assume 0 != ~p3~0;~lk3~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:19,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:19,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:19,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:19,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:19,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:19,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {2028#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2024#false} is VALID [2022-04-28 15:01:19,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#false} assume !false; {2024#false} is VALID [2022-04-28 15:01:19,033 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-28 15:01:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:19,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13503845] [2022-04-28 15:01:19,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13503845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:19,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:19,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:19,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:19,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377809225] [2022-04-28 15:01:19,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377809225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:19,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:19,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:19,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599555478] [2022-04-28 15:01:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:19,035 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-28 15:01:19,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:19,035 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-28 15:01:19,047 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-28 15:01:19,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:19,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:19,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:19,048 INFO L87 Difference]: Start difference. First operand 75 states and 115 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-28 15:01:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:19,143 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-04-28 15:01:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:19,143 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-28 15:01:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:19,143 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-28 15:01:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-28 15:01:19,145 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-28 15:01:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-28 15:01:19,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-04-28 15:01:19,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:19,194 INFO L225 Difference]: With dead ends: 131 [2022-04-28 15:01:19,194 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 15:01:19,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:19,196 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:19,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 15:01:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-04-28 15:01:19,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:19,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:19,212 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:19,212 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:19,216 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-28 15:01:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-28 15:01:19,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:19,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:19,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 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 129 states. [2022-04-28 15:01:19,217 INFO L87 Difference]: Start difference. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 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 129 states. [2022-04-28 15:01:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:19,222 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-28 15:01:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-28 15:01:19,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:19,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:19,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:19,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-04-28 15:01:19,227 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-04-28 15:01:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:19,227 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-04-28 15:01:19,227 INFO L496 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-28 15:01:19,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 157 transitions. [2022-04-28 15:01:19,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-04-28 15:01:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 15:01:19,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:19,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:19,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:01:19,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-04-28 15:01:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:19,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386519345] [2022-04-28 15:01:19,383 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 2 times [2022-04-28 15:01:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:19,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609050410] [2022-04-28 15:01:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:19,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#(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); {2761#true} is VALID [2022-04-28 15:01:19,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-04-28 15:01:19,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2761#true} {2761#true} #115#return; {2761#true} is VALID [2022-04-28 15:01:19,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {2761#true} call ULTIMATE.init(); {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:19,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#(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); {2761#true} is VALID [2022-04-28 15:01:19,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-04-28 15:01:19,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2761#true} {2761#true} #115#return; {2761#true} is VALID [2022-04-28 15:01:19,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {2761#true} call #t~ret10 := main(); {2761#true} is VALID [2022-04-28 15:01:19,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {2761#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;havoc ~cond~0; {2761#true} is VALID [2022-04-28 15:01:19,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2761#true} is VALID [2022-04-28 15:01:19,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {2761#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2761#true} is VALID [2022-04-28 15:01:19,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !(0 != ~p1~0); {2761#true} is VALID [2022-04-28 15:01:19,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#true} assume !(0 != ~p2~0); {2761#true} is VALID [2022-04-28 15:01:19,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !(0 != ~p3~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:19,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2766#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:19,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2766#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:19,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {2766#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:19,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {2766#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:19,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p3~0; {2762#false} is VALID [2022-04-28 15:01:19,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#false} assume 1 != ~lk3~0; {2762#false} is VALID [2022-04-28 15:01:19,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2022-04-28 15:01:19,422 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-28 15:01:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:19,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609050410] [2022-04-28 15:01:19,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609050410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:19,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:19,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:19,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:19,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386519345] [2022-04-28 15:01:19,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386519345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:19,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:19,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:19,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526162002] [2022-04-28 15:01:19,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:19,424 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-28 15:01:19,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:19,424 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-28 15:01:19,435 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-28 15:01:19,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:19,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:19,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:19,436 INFO L87 Difference]: Start difference. First operand 103 states and 157 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-28 15:01:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:19,540 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-04-28 15:01:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:19,540 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-28 15:01:19,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:19,540 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-28 15:01:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-28 15:01:19,542 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-28 15:01:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-28 15:01:19,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2022-04-28 15:01:19,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:19,621 INFO L225 Difference]: With dead ends: 231 [2022-04-28 15:01:19,621 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 15:01:19,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:19,622 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:19,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 15:01:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-28 15:01:19,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:19,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:19,643 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:19,643 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:19,647 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-28 15:01:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-28 15:01:19,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:19,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:19,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 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 137 states. [2022-04-28 15:01:19,649 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 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 137 states. [2022-04-28 15:01:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:19,653 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-28 15:01:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-28 15:01:19,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:19,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:19,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:19,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-04-28 15:01:19,657 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-04-28 15:01:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:19,658 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-04-28 15:01:19,658 INFO L496 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-28 15:01:19,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 199 transitions. [2022-04-28 15:01:19,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-04-28 15:01:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 15:01:19,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:19,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:19,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:01:19,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-04-28 15:01:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:19,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977630045] [2022-04-28 15:01:19,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 2 times [2022-04-28 15:01:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:19,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26272818] [2022-04-28 15:01:19,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:19,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:19,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {3785#(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); {3779#true} is VALID [2022-04-28 15:01:19,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {3779#true} assume true; {3779#true} is VALID [2022-04-28 15:01:19,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3779#true} {3779#true} #115#return; {3779#true} is VALID [2022-04-28 15:01:19,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:19,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {3785#(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); {3779#true} is VALID [2022-04-28 15:01:19,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {3779#true} assume true; {3779#true} is VALID [2022-04-28 15:01:19,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3779#true} {3779#true} #115#return; {3779#true} is VALID [2022-04-28 15:01:19,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {3779#true} call #t~ret10 := main(); {3779#true} is VALID [2022-04-28 15:01:19,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {3779#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;havoc ~cond~0; {3779#true} is VALID [2022-04-28 15:01:19,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {3779#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {3779#true} is VALID [2022-04-28 15:01:19,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {3779#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3779#true} is VALID [2022-04-28 15:01:19,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {3779#true} assume !(0 != ~p1~0); {3779#true} is VALID [2022-04-28 15:01:19,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {3779#true} assume !(0 != ~p2~0); {3779#true} is VALID [2022-04-28 15:01:19,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {3779#true} assume 0 != ~p3~0;~lk3~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:19,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {3784#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:19,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {3784#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:19,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:19,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:19,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3780#false} is VALID [2022-04-28 15:01:19,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {3780#false} assume 0 != ~p4~0; {3780#false} is VALID [2022-04-28 15:01:19,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {3780#false} assume 1 != ~lk4~0; {3780#false} is VALID [2022-04-28 15:01:19,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2022-04-28 15:01:19,925 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-28 15:01:19,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:19,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26272818] [2022-04-28 15:01:19,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26272818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:19,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:19,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:19,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:19,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [977630045] [2022-04-28 15:01:19,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [977630045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:19,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:19,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383666358] [2022-04-28 15:01:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:19,928 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-28 15:01:19,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:19,928 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-28 15:01:19,941 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-28 15:01:19,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:19,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:19,943 INFO L87 Difference]: Start difference. First operand 135 states and 199 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-28 15:01:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:20,048 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-04-28 15:01:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:20,049 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-28 15:01:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:20,049 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-28 15:01:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 15:01:20,053 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-28 15:01:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 15:01:20,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 15:01:20,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:20,121 INFO L225 Difference]: With dead ends: 205 [2022-04-28 15:01:20,121 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 15:01:20,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:20,123 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:20,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 15:01:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-28 15:01:20,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:20,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:20,141 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:20,142 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:20,146 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-28 15:01:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-28 15:01:20,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:20,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:20,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 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 143 states. [2022-04-28 15:01:20,147 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 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 143 states. [2022-04-28 15:01:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:20,151 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-28 15:01:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-28 15:01:20,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:20,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:20,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:20,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-04-28 15:01:20,156 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-04-28 15:01:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:20,156 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-04-28 15:01:20,156 INFO L496 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-28 15:01:20,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 203 transitions. [2022-04-28 15:01:20,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-04-28 15:01:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 15:01:20,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:20,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:20,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:01:20,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-04-28 15:01:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:20,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [660406475] [2022-04-28 15:01:20,397 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 2 times [2022-04-28 15:01:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:20,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557635580] [2022-04-28 15:01:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:20,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {4775#(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); {4769#true} is VALID [2022-04-28 15:01:20,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-28 15:01:20,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4769#true} {4769#true} #115#return; {4769#true} is VALID [2022-04-28 15:01:20,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {4769#true} call ULTIMATE.init(); {4775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:20,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {4775#(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); {4769#true} is VALID [2022-04-28 15:01:20,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-28 15:01:20,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4769#true} {4769#true} #115#return; {4769#true} is VALID [2022-04-28 15:01:20,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {4769#true} call #t~ret10 := main(); {4769#true} is VALID [2022-04-28 15:01:20,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {4769#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;havoc ~cond~0; {4769#true} is VALID [2022-04-28 15:01:20,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {4769#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {4769#true} is VALID [2022-04-28 15:01:20,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {4769#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4769#true} is VALID [2022-04-28 15:01:20,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {4769#true} assume !(0 != ~p1~0); {4769#true} is VALID [2022-04-28 15:01:20,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {4769#true} assume !(0 != ~p2~0); {4769#true} is VALID [2022-04-28 15:01:20,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {4769#true} assume !(0 != ~p3~0); {4769#true} is VALID [2022-04-28 15:01:20,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {4769#true} assume 0 != ~p4~0;~lk4~0 := 1; {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:20,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {4774#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:20,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:20,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:20,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:20,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(= main_~lk4~0 1)} assume 0 != ~p4~0; {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:20,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {4774#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {4770#false} is VALID [2022-04-28 15:01:20,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {4770#false} assume !false; {4770#false} is VALID [2022-04-28 15:01:20,435 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-28 15:01:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:20,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557635580] [2022-04-28 15:01:20,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557635580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:20,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:20,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:20,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:20,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [660406475] [2022-04-28 15:01:20,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [660406475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:20,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:20,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113164880] [2022-04-28 15:01:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:20,436 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-28 15:01:20,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:20,437 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-28 15:01:20,450 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-28 15:01:20,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:20,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:20,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:20,451 INFO L87 Difference]: Start difference. First operand 141 states and 203 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-28 15:01:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:20,582 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-04-28 15:01:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:20,583 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-28 15:01:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:20,583 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-28 15:01:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-28 15:01:20,584 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-28 15:01:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-28 15:01:20,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-04-28 15:01:20,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:20,637 INFO L225 Difference]: With dead ends: 237 [2022-04-28 15:01:20,637 INFO L226 Difference]: Without dead ends: 235 [2022-04-28 15:01:20,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:20,638 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:20,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-28 15:01:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-04-28 15:01:20,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:20,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:20,663 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:20,664 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:20,671 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-28 15:01:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-28 15:01:20,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:20,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:20,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 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 235 states. [2022-04-28 15:01:20,673 INFO L87 Difference]: Start difference. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 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 235 states. [2022-04-28 15:01:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:20,679 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-28 15:01:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-28 15:01:20,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:20,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:20,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:20,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-04-28 15:01:20,687 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-04-28 15:01:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:20,687 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-04-28 15:01:20,687 INFO L496 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-28 15:01:20,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 201 states and 283 transitions. [2022-04-28 15:01:21,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-04-28 15:01:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 15:01:21,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:21,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:21,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:01:21,008 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-04-28 15:01:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917406416] [2022-04-28 15:01:21,009 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 2 times [2022-04-28 15:01:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424779091] [2022-04-28 15:01:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:21,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:21,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {6133#(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); {6127#true} is VALID [2022-04-28 15:01:21,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {6127#true} assume true; {6127#true} is VALID [2022-04-28 15:01:21,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6127#true} {6127#true} #115#return; {6127#true} is VALID [2022-04-28 15:01:21,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {6127#true} call ULTIMATE.init(); {6133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:21,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {6133#(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); {6127#true} is VALID [2022-04-28 15:01:21,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {6127#true} assume true; {6127#true} is VALID [2022-04-28 15:01:21,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6127#true} {6127#true} #115#return; {6127#true} is VALID [2022-04-28 15:01:21,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {6127#true} call #t~ret10 := main(); {6127#true} is VALID [2022-04-28 15:01:21,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {6127#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;havoc ~cond~0; {6127#true} is VALID [2022-04-28 15:01:21,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {6127#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {6127#true} is VALID [2022-04-28 15:01:21,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {6127#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {6127#true} is VALID [2022-04-28 15:01:21,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {6127#true} assume !(0 != ~p1~0); {6127#true} is VALID [2022-04-28 15:01:21,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {6127#true} assume !(0 != ~p2~0); {6127#true} is VALID [2022-04-28 15:01:21,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {6127#true} assume !(0 != ~p3~0); {6127#true} is VALID [2022-04-28 15:01:21,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {6127#true} assume !(0 != ~p4~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:21,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {6132#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6132#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:21,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p1~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:21,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p2~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:21,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p3~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:21,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(= main_~p4~0 0)} assume 0 != ~p4~0; {6128#false} is VALID [2022-04-28 15:01:21,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#false} assume 1 != ~lk4~0; {6128#false} is VALID [2022-04-28 15:01:21,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {6128#false} assume !false; {6128#false} is VALID [2022-04-28 15:01:21,049 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-28 15:01:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424779091] [2022-04-28 15:01:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424779091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:21,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:21,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:21,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917406416] [2022-04-28 15:01:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917406416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:21,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:21,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730282680] [2022-04-28 15:01:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:21,051 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-28 15:01:21,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:21,051 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-28 15:01:21,063 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-28 15:01:21,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:21,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:21,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:21,064 INFO L87 Difference]: Start difference. First operand 201 states and 283 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-28 15:01:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:21,175 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-04-28 15:01:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:21,175 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-28 15:01:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:21,175 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-28 15:01:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-28 15:01:21,177 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-28 15:01:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-28 15:01:21,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-28 15:01:21,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:21,250 INFO L225 Difference]: With dead ends: 445 [2022-04-28 15:01:21,250 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 15:01:21,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:21,251 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:21,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 15:01:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-28 15:01:21,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:21,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,273 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,274 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:21,280 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-28 15:01:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-28 15:01:21,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:21,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:21,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 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 259 states. [2022-04-28 15:01:21,281 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 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 259 states. [2022-04-28 15:01:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:21,287 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-28 15:01:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-28 15:01:21,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:21,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:21,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:21,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-04-28 15:01:21,295 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-04-28 15:01:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:21,295 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-04-28 15:01:21,296 INFO L496 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-28 15:01:21,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 343 transitions. [2022-04-28 15:01:21,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-04-28 15:01:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:21,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:21,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:21,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:01:21,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-04-28 15:01:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:21,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506691689] [2022-04-28 15:01:21,677 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 2 times [2022-04-28 15:01:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:21,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047804044] [2022-04-28 15:01:21,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:21,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:21,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {8067#(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); {8061#true} is VALID [2022-04-28 15:01:21,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-28 15:01:21,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8061#true} {8061#true} #115#return; {8061#true} is VALID [2022-04-28 15:01:21,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {8061#true} call ULTIMATE.init(); {8067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:21,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {8067#(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); {8061#true} is VALID [2022-04-28 15:01:21,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-28 15:01:21,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8061#true} {8061#true} #115#return; {8061#true} is VALID [2022-04-28 15:01:21,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {8061#true} call #t~ret10 := main(); {8061#true} is VALID [2022-04-28 15:01:21,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {8061#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;havoc ~cond~0; {8061#true} is VALID [2022-04-28 15:01:21,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {8061#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {8061#true} is VALID [2022-04-28 15:01:21,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {8061#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {8061#true} is VALID [2022-04-28 15:01:21,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {8061#true} assume !(0 != ~p1~0); {8061#true} is VALID [2022-04-28 15:01:21,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {8061#true} assume !(0 != ~p2~0); {8061#true} is VALID [2022-04-28 15:01:21,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {8061#true} assume !(0 != ~p3~0); {8061#true} is VALID [2022-04-28 15:01:21,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {8061#true} assume 0 != ~p4~0;~lk4~0 := 1; {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:21,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {8066#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:21,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:21,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:21,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:21,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {8062#false} is VALID [2022-04-28 15:01:21,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {8062#false} assume 0 != ~p5~0; {8062#false} is VALID [2022-04-28 15:01:21,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {8062#false} assume 1 != ~lk5~0; {8062#false} is VALID [2022-04-28 15:01:21,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {8062#false} assume !false; {8062#false} is VALID [2022-04-28 15:01:21,719 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-28 15:01:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047804044] [2022-04-28 15:01:21,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047804044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:21,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:21,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:21,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506691689] [2022-04-28 15:01:21,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506691689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:21,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:21,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908967279] [2022-04-28 15:01:21,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:21,721 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-28 15:01:21,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:21,721 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-28 15:01:21,735 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-28 15:01:21,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:21,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:21,736 INFO L87 Difference]: Start difference. First operand 257 states and 343 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-28 15:01:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:21,865 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-04-28 15:01:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:21,865 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-28 15:01:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:21,865 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-28 15:01:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 15:01:21,866 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-28 15:01:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 15:01:21,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-28 15:01:21,928 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-28 15:01:21,934 INFO L225 Difference]: With dead ends: 385 [2022-04-28 15:01:21,934 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:01:21,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:21,935 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:21,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:01:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-04-28 15:01:21,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:21,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,958 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,959 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:21,965 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-28 15:01:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-28 15:01:21,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:21,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:21,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 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 267 states. [2022-04-28 15:01:21,966 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 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 267 states. [2022-04-28 15:01:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:21,972 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-28 15:01:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-28 15:01:21,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:21,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:21,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:21,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-04-28 15:01:21,981 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-04-28 15:01:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:21,981 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-04-28 15:01:21,981 INFO L496 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-28 15:01:21,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 343 transitions. [2022-04-28 15:01:22,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-04-28 15:01:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:22,331 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:22,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:22,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:01:22,332 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-04-28 15:01:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:22,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434491797] [2022-04-28 15:01:22,333 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 2 times [2022-04-28 15:01:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:22,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327574072] [2022-04-28 15:01:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:22,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {9913#(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); {9907#true} is VALID [2022-04-28 15:01:22,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {9907#true} assume true; {9907#true} is VALID [2022-04-28 15:01:22,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9907#true} {9907#true} #115#return; {9907#true} is VALID [2022-04-28 15:01:22,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {9907#true} call ULTIMATE.init(); {9913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:22,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {9913#(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); {9907#true} is VALID [2022-04-28 15:01:22,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {9907#true} assume true; {9907#true} is VALID [2022-04-28 15:01:22,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9907#true} {9907#true} #115#return; {9907#true} is VALID [2022-04-28 15:01:22,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {9907#true} call #t~ret10 := main(); {9907#true} is VALID [2022-04-28 15:01:22,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {9907#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;havoc ~cond~0; {9907#true} is VALID [2022-04-28 15:01:22,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {9907#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {9907#true} is VALID [2022-04-28 15:01:22,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {9907#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {9907#true} is VALID [2022-04-28 15:01:22,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {9907#true} assume !(0 != ~p1~0); {9907#true} is VALID [2022-04-28 15:01:22,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {9907#true} assume !(0 != ~p2~0); {9907#true} is VALID [2022-04-28 15:01:22,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {9907#true} assume !(0 != ~p3~0); {9907#true} is VALID [2022-04-28 15:01:22,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {9907#true} assume !(0 != ~p4~0); {9907#true} is VALID [2022-04-28 15:01:22,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {9907#true} assume 0 != ~p5~0;~lk5~0 := 1; {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:22,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:22,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:22,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:22,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:22,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {9912#(= main_~lk5~0 1)} assume 0 != ~p5~0; {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:22,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {9912#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {9908#false} is VALID [2022-04-28 15:01:22,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {9908#false} assume !false; {9908#false} is VALID [2022-04-28 15:01:22,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-28 15:01:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:22,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327574072] [2022-04-28 15:01:22,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327574072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:22,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:22,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:22,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:22,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434491797] [2022-04-28 15:01:22,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434491797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:22,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:22,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699649102] [2022-04-28 15:01:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:22,374 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-28 15:01:22,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:22,374 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-28 15:01:22,389 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-28 15:01:22,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:22,389 INFO L87 Difference]: Start difference. First operand 265 states and 343 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-28 15:01:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:22,523 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-04-28 15:01:22,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:22,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-28 15:01:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:22,523 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-28 15:01:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 15:01:22,524 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-28 15:01:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 15:01:22,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-28 15:01:22,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:22,585 INFO L225 Difference]: With dead ends: 427 [2022-04-28 15:01:22,585 INFO L226 Difference]: Without dead ends: 425 [2022-04-28 15:01:22,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:22,586 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:22,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-28 15:01:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-04-28 15:01:22,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:22,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:22,618 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:22,618 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:22,630 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-28 15:01:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-28 15:01:22,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:22,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:22,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 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 425 states. [2022-04-28 15:01:22,632 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 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 425 states. [2022-04-28 15:01:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:22,644 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-28 15:01:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-28 15:01:22,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:22,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:22,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:22,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-04-28 15:01:22,659 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-04-28 15:01:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:22,660 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-04-28 15:01:22,660 INFO L496 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-28 15:01:22,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 495 transitions. [2022-04-28 15:01:23,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-04-28 15:01:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:23,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:23,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:23,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:01:23,121 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:23,121 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-04-28 15:01:23,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:23,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1392013074] [2022-04-28 15:01:23,122 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 2 times [2022-04-28 15:01:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:23,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833605136] [2022-04-28 15:01:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:23,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {12415#(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); {12409#true} is VALID [2022-04-28 15:01:23,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {12409#true} assume true; {12409#true} is VALID [2022-04-28 15:01:23,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12409#true} {12409#true} #115#return; {12409#true} is VALID [2022-04-28 15:01:23,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {12409#true} call ULTIMATE.init(); {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:23,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {12415#(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); {12409#true} is VALID [2022-04-28 15:01:23,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {12409#true} assume true; {12409#true} is VALID [2022-04-28 15:01:23,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12409#true} {12409#true} #115#return; {12409#true} is VALID [2022-04-28 15:01:23,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {12409#true} call #t~ret10 := main(); {12409#true} is VALID [2022-04-28 15:01:23,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {12409#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;havoc ~cond~0; {12409#true} is VALID [2022-04-28 15:01:23,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {12409#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {12409#true} is VALID [2022-04-28 15:01:23,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {12409#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {12409#true} is VALID [2022-04-28 15:01:23,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {12409#true} assume !(0 != ~p1~0); {12409#true} is VALID [2022-04-28 15:01:23,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {12409#true} assume !(0 != ~p2~0); {12409#true} is VALID [2022-04-28 15:01:23,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {12409#true} assume !(0 != ~p3~0); {12409#true} is VALID [2022-04-28 15:01:23,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {12409#true} assume !(0 != ~p4~0); {12409#true} is VALID [2022-04-28 15:01:23,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {12409#true} assume !(0 != ~p5~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:23,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p1~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:23,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p2~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:23,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p3~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:23,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p4~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:23,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {12414#(= main_~p5~0 0)} assume 0 != ~p5~0; {12410#false} is VALID [2022-04-28 15:01:23,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {12410#false} assume 1 != ~lk5~0; {12410#false} is VALID [2022-04-28 15:01:23,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {12410#false} assume !false; {12410#false} is VALID [2022-04-28 15:01:23,175 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-28 15:01:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:23,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833605136] [2022-04-28 15:01:23,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833605136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:23,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:23,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:23,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:23,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1392013074] [2022-04-28 15:01:23,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1392013074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:23,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:23,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:23,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188587471] [2022-04-28 15:01:23,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:23,177 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-28 15:01:23,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:23,177 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-28 15:01:23,189 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-28 15:01:23,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:23,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:23,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:23,190 INFO L87 Difference]: Start difference. First operand 393 states and 495 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-28 15:01:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:23,375 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-04-28 15:01:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:23,375 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-28 15:01:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:23,376 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-28 15:01:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 15:01:23,377 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-28 15:01:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 15:01:23,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-28 15:01:23,439 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-28 15:01:23,439 INFO L225 Difference]: With dead ends: 857 [2022-04-28 15:01:23,439 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 15:01:23,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:23,441 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:23,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 15:01:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 15:01:23,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:23,442 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-28 15:01:23,442 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-28 15:01:23,442 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-28 15:01:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:23,442 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:01:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:01:23,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:23,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:23,442 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-28 15:01:23,442 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-28 15:01:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:23,442 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:01:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:01:23,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:23,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:23,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:23,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:23,443 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-28 15:01:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 15:01:23,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-28 15:01:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:23,443 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 15:01:23,443 INFO L496 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-28 15:01:23,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 15:01:23,443 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-28 15:01:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:01:23,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:23,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:01:23,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:01:23,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 15:01:26,643 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 15:01:26,643 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 15:01:26,643 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 15:01:26,644 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 15:01:26,644 INFO L895 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-28 15:01:26,644 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 15:01:26,644 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 15:01:26,644 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 15:01:26,644 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 15:01:26,644 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 15:01:26,644 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-04-28 15:01:26,644 INFO L902 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-04-28 15:01:26,644 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (not (= main_~p4~0 0))) (.cse1 (= main_~lk4~0 1))) (or (and .cse0 .cse1 (= main_~p5~0 0)) (and (= main_~lk5~0 1) .cse0 .cse1))) [2022-04-28 15:01:26,645 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3 .cse6) (and .cse4 .cse7 .cse3 .cse6) (and .cse4 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse5) (and .cse4 .cse2 .cse7 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse1 .cse7 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse6 .cse5) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse0 .cse6 .cse5) (and .cse1 .cse2 .cse7 .cse3))) [2022-04-28 15:01:26,645 INFO L902 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-04-28 15:01:26,645 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-04-28 15:01:26,645 INFO L895 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-04-28 15:01:26,645 INFO L895 garLoopResultBuilder]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse0 .cse5) (and .cse3 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse3 .cse4 .cse1) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 .cse1))) [2022-04-28 15:01:26,646 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (not (= main_~p1~0 0))) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse9 (= main_~lk3~0 1)) (.cse3 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse8))) [2022-04-28 15:01:26,646 INFO L902 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-04-28 15:01:26,646 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-04-28 15:01:26,646 INFO L895 garLoopResultBuilder]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk4~0 1)) (.cse0 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2022-04-28 15:01:26,646 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk3~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse3) (and .cse1 .cse4 .cse6 .cse3) (and .cse1 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse6 .cse3))) [2022-04-28 15:01:26,647 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-04-28 15:01:26,647 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-04-28 15:01:26,647 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 26 90) 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-28 15:01:26,647 INFO L895 garLoopResultBuilder]: At program point L55-1(lines 26 90) 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-28 15:01:26,647 INFO L895 garLoopResultBuilder]: At program point L51-1(lines 26 90) 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-28 15:01:26,647 INFO L895 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-04-28 15:01:26,647 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 26 90) 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-28 15:01:26,648 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4))) [2022-04-28 15:01:26,648 INFO L902 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-04-28 15:01:26,648 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 15:01:26,650 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 15:01:26,652 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:01:26,654 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:01:26,660 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:01:26,682 INFO L163 areAnnotationChecker]: CFG has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 15:01:26,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:01:26 BoogieIcfgContainer [2022-04-28 15:01:26,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:01:26,690 INFO L158 Benchmark]: Toolchain (without parser) took 10916.28ms. Allocated memory was 201.3MB in the beginning and 368.1MB in the end (delta: 166.7MB). Free memory was 147.5MB in the beginning and 148.2MB in the end (delta: -669.8kB). Peak memory consumption was 169.3MB. Max. memory is 8.0GB. [2022-04-28 15:01:26,692 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:01:26,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.42ms. Allocated memory was 201.3MB in the beginning and 254.8MB in the end (delta: 53.5MB). Free memory was 147.2MB in the beginning and 226.1MB in the end (delta: -78.8MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-28 15:01:26,694 INFO L158 Benchmark]: Boogie Preprocessor took 29.75ms. Allocated memory is still 254.8MB. Free memory was 226.1MB in the beginning and 224.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 15:01:26,694 INFO L158 Benchmark]: RCFGBuilder took 279.25ms. Allocated memory is still 254.8MB. Free memory was 224.4MB in the beginning and 212.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 15:01:26,695 INFO L158 Benchmark]: TraceAbstraction took 10343.89ms. Allocated memory was 254.8MB in the beginning and 368.1MB in the end (delta: 113.2MB). Free memory was 211.9MB in the beginning and 148.2MB in the end (delta: 63.7MB). Peak memory consumption was 180.6MB. Max. memory is 8.0GB. [2022-04-28 15:01:26,696 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.15ms. Allocated memory is still 201.3MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.42ms. Allocated memory was 201.3MB in the beginning and 254.8MB in the end (delta: 53.5MB). Free memory was 147.2MB in the beginning and 226.1MB in the end (delta: -78.8MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.75ms. Allocated memory is still 254.8MB. Free memory was 226.1MB in the beginning and 224.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 279.25ms. Allocated memory is still 254.8MB. Free memory was 224.4MB in the beginning and 212.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10343.89ms. Allocated memory was 254.8MB in the beginning and 368.1MB in the end (delta: 113.2MB). Free memory was 211.9MB in the beginning and 148.2MB in the end (delta: 63.7MB). Peak memory consumption was 180.6MB. 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: 93]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 628 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 519 NumberOfFragments, 1696 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 15:01:26,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...