/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:20:10,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:20:10,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:20:10,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:20:10,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:20:10,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:20:10,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:20:10,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:20:10,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:20:10,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:20:10,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:20:10,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:20:10,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:20:10,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:20:10,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:20:10,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:20:10,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:20:10,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:20:10,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:20:10,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:20:10,384 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:20:10,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:20:10,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:20:10,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:20:10,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:20:10,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:20:10,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:20:10,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:20:10,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:20:10,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:20:10,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:20:10,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:20:10,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:20:10,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:20:10,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:20:10,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:20:10,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:20:10,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:20:10,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:20:10,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:20:10,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:20:10,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:20:10,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:20:10,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:20:10,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:20:10,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:20:10,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:20:10,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:20:10,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:20:10,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:20:10,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:20:10,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:20:10,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:20:10,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:20:10,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:20:10,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:20:10,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:20:10,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:20:10,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:20:10,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:20:10,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:20:10,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:20:10,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:20:10,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:20:10,413 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:20:10,413 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:20:10,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:20:10,413 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:20:10,413 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 08:20:10,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:20:10,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:20:10,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:20:10,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:20:10,616 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:20:10,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-04-28 08:20:10,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb47e970/4575bdd1f54d4ce2b57f8bd363b3ba9c/FLAG50753f329 [2022-04-28 08:20:11,033 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:20:11,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-04-28 08:20:11,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb47e970/4575bdd1f54d4ce2b57f8bd363b3ba9c/FLAG50753f329 [2022-04-28 08:20:11,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb47e970/4575bdd1f54d4ce2b57f8bd363b3ba9c [2022-04-28 08:20:11,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:20:11,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:20:11,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:20:11,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:20:11,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:20:11,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a104a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11, skipping insertion in model container [2022-04-28 08:20:11,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:20:11,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:20:11,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2022-04-28 08:20:11,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:20:11,226 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:20:11,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2022-04-28 08:20:11,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:20:11,252 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:20:11,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11 WrapperNode [2022-04-28 08:20:11,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:20:11,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:20:11,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:20:11,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:20:11,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:20:11,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:20:11,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:20:11,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:20:11,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (1/1) ... [2022-04-28 08:20:11,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:20:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:20:11,297 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 08:20:11,320 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 08:20:11,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:20:11,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:20:11,335 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:20:11,335 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:20:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:20:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:20:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:20:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:20:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:20:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:20:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:20:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:20:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:20:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:20:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:20:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:20:11,380 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:20:11,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:20:11,624 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:20:11,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:20:11,629 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:20:11,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:20:11 BoogieIcfgContainer [2022-04-28 08:20:11,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:20:11,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:20:11,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:20:11,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:20:11,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:20:11" (1/3) ... [2022-04-28 08:20:11,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3686ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:20:11, skipping insertion in model container [2022-04-28 08:20:11,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:20:11" (2/3) ... [2022-04-28 08:20:11,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3686ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:20:11, skipping insertion in model container [2022-04-28 08:20:11,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:20:11" (3/3) ... [2022-04-28 08:20:11,642 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-04-28 08:20:11,654 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:20:11,654 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:20:11,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:20:11,709 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@6a48964f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4432e019 [2022-04-28 08:20:11,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:20:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:20:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 08:20:11,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:11,730 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 08:20:11,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-04-28 08:20:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:11,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623676845] [2022-04-28 08:20:11,750 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 2 times [2022-04-28 08:20:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:11,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274957676] [2022-04-28 08:20:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:11,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 08:20:11,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 08:20:11,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-28 08:20:11,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:11,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 08:20:11,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 08:20:11,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-28 08:20:11,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret12 := main(); {39#true} is VALID [2022-04-28 08:20:11,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {39#true} is VALID [2022-04-28 08:20:11,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {39#true} is VALID [2022-04-28 08:20:11,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {39#true} is VALID [2022-04-28 08:20:11,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 != ~p1~0;~lk1~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-28 08:20:11,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {44#(= main_~lk1~0 1)} is VALID [2022-04-28 08:20:11,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-28 08:20:11,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-28 08:20:11,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-28 08:20:11,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-28 08:20:11,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-28 08:20:11,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p1~0; {44#(= main_~lk1~0 1)} is VALID [2022-04-28 08:20:11,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {40#false} is VALID [2022-04-28 08:20:11,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 08:20:11,991 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 08:20:11,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:11,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274957676] [2022-04-28 08:20:11,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274957676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:11,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:11,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:11,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623676845] [2022-04-28 08:20:11,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623676845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:11,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:11,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012776771] [2022-04-28 08:20:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:11,999 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 08:20:12,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:12,002 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 08:20:12,028 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 08:20:12,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:12,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:12,049 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:12,313 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-28 08:20:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:12,314 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 08:20:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:12,315 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 08:20:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 08:20:12,327 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 08:20:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 08:20:12,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 08:20:12,427 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 08:20:12,433 INFO L225 Difference]: With dead ends: 70 [2022-04-28 08:20:12,434 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 08:20:12,435 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 08:20:12,437 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:12,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:20:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 08:20:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-04-28 08:20:12,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:12,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,463 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,464 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:12,467 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-28 08:20:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-28 08:20:12,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:12,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:12,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 08:20:12,469 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 08:20:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:12,472 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-28 08:20:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-28 08:20:12,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:12,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:12,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:12,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-04-28 08:20:12,475 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-04-28 08:20:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:12,476 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-04-28 08:20:12,476 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 08:20:12,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 66 transitions. [2022-04-28 08:20:12,536 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 08:20:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-04-28 08:20:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 08:20:12,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:12,537 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 08:20:12,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:20:12,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-04-28 08:20:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:12,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128686417] [2022-04-28 08:20:12,538 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 2 times [2022-04-28 08:20:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:12,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924259927] [2022-04-28 08:20:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:12,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:12,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:12,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-28 08:20:12,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-28 08:20:12,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #149#return; {379#true} is VALID [2022-04-28 08:20:12,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:12,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-28 08:20:12,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-28 08:20:12,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #149#return; {379#true} is VALID [2022-04-28 08:20:12,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret12 := main(); {379#true} is VALID [2022-04-28 08:20:12,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {379#true} is VALID [2022-04-28 08:20:12,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {379#true} is VALID [2022-04-28 08:20:12,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {379#true} is VALID [2022-04-28 08:20:12,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#true} assume !(0 != ~p1~0); {384#(= main_~p1~0 0)} is VALID [2022-04-28 08:20:12,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(= main_~p1~0 0)} assume !(0 != ~p2~0); {384#(= main_~p1~0 0)} is VALID [2022-04-28 08:20:12,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-28 08:20:12,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-28 08:20:12,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-28 08:20:12,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-28 08:20:12,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-28 08:20:12,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p1~0; {380#false} is VALID [2022-04-28 08:20:12,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {380#false} assume 1 != ~lk1~0; {380#false} is VALID [2022-04-28 08:20:12,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-28 08:20:12,597 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 08:20:12,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924259927] [2022-04-28 08:20:12,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924259927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:12,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:12,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:12,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:12,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128686417] [2022-04-28 08:20:12,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128686417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:12,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:12,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627438190] [2022-04-28 08:20:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:12,609 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 08:20:12,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:12,610 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 08:20:12,622 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 08:20:12,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:12,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:12,624 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:12,764 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-28 08:20:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:12,765 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 08:20:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:12,765 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 08:20:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 08:20:12,767 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 08:20:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 08:20:12,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-28 08:20:12,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:12,875 INFO L225 Difference]: With dead ends: 88 [2022-04-28 08:20:12,876 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 08:20:12,876 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 08:20:12,877 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:12,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 08:20:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-28 08:20:12,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:12,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,884 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,884 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:12,886 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-28 08:20:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-28 08:20:12,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:12,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:12,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 08:20:12,888 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 08:20:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:12,890 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-28 08:20:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-28 08:20:12,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:12,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:12,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:12,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-04-28 08:20:12,893 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-04-28 08:20:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:12,893 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-04-28 08:20:12,893 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 08:20:12,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 90 transitions. [2022-04-28 08:20:12,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-04-28 08:20:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:20:12,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:12,965 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 08:20:12,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:20:12,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-04-28 08:20:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:12,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366495512] [2022-04-28 08:20:12,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 2 times [2022-04-28 08:20:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:12,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698353110] [2022-04-28 08:20:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:13,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-28 08:20:13,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 08:20:13,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {783#true} {783#true} #149#return; {783#true} is VALID [2022-04-28 08:20:13,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:13,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-28 08:20:13,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 08:20:13,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #149#return; {783#true} is VALID [2022-04-28 08:20:13,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret12 := main(); {783#true} is VALID [2022-04-28 08:20:13,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {783#true} is VALID [2022-04-28 08:20:13,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {783#true} is VALID [2022-04-28 08:20:13,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {783#true} is VALID [2022-04-28 08:20:13,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume 0 != ~p1~0;~lk1~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:20:13,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {788#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:20:13,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:20:13,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:20:13,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:20:13,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:20:13,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:20:13,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {784#false} is VALID [2022-04-28 08:20:13,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#false} assume 0 != ~p2~0; {784#false} is VALID [2022-04-28 08:20:13,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#false} assume 1 != ~lk2~0; {784#false} is VALID [2022-04-28 08:20:13,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-28 08:20:13,025 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 08:20:13,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:13,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698353110] [2022-04-28 08:20:13,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698353110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:13,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:13,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:13,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:13,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366495512] [2022-04-28 08:20:13,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366495512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:13,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:13,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:13,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267367090] [2022-04-28 08:20:13,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:13,026 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 08:20:13,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:13,027 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 08:20:13,044 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 08:20:13,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:13,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:13,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:13,046 INFO L87 Difference]: Start difference. First operand 53 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:13,182 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-04-28 08:20:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:13,182 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 08:20:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:13,182 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 08:20:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 08:20:13,184 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 08:20:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 08:20:13,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-28 08:20:13,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:13,296 INFO L225 Difference]: With dead ends: 82 [2022-04-28 08:20:13,296 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 08:20:13,296 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 08:20:13,297 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:13,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 08:20:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-28 08:20:13,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:13,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,303 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,304 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:13,305 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-28 08:20:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-28 08:20:13,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:13,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:13,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 08:20:13,306 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 08:20:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:13,309 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-28 08:20:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-28 08:20:13,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:13,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:13,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:13,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-04-28 08:20:13,312 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-04-28 08:20:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:13,313 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-04-28 08:20:13,313 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 08:20:13,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 92 transitions. [2022-04-28 08:20:13,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-04-28 08:20:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:20:13,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:13,393 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 08:20:13,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:20:13,393 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-04-28 08:20:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:13,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2101240716] [2022-04-28 08:20:13,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 2 times [2022-04-28 08:20:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:13,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435765901] [2022-04-28 08:20:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:13,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:13,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1187#true} is VALID [2022-04-28 08:20:13,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-28 08:20:13,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1187#true} {1187#true} #149#return; {1187#true} is VALID [2022-04-28 08:20:13,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {1187#true} call ULTIMATE.init(); {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:13,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1187#true} is VALID [2022-04-28 08:20:13,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-28 08:20:13,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1187#true} {1187#true} #149#return; {1187#true} is VALID [2022-04-28 08:20:13,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {1187#true} call #t~ret12 := main(); {1187#true} is VALID [2022-04-28 08:20:13,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {1187#true} is VALID [2022-04-28 08:20:13,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1187#true} is VALID [2022-04-28 08:20:13,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1187#true} is VALID [2022-04-28 08:20:13,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#true} assume !(0 != ~p1~0); {1187#true} is VALID [2022-04-28 08:20:13,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#true} assume !(0 != ~p2~0); {1192#(= main_~p2~0 0)} is VALID [2022-04-28 08:20:13,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-28 08:20:13,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-28 08:20:13,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-28 08:20:13,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-28 08:20:13,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-28 08:20:13,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1192#(= main_~p2~0 0)} is VALID [2022-04-28 08:20:13,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p2~0; {1188#false} is VALID [2022-04-28 08:20:13,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#false} assume 1 != ~lk2~0; {1188#false} is VALID [2022-04-28 08:20:13,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2022-04-28 08:20:13,442 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 08:20:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:13,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435765901] [2022-04-28 08:20:13,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435765901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:13,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:13,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:13,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:13,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2101240716] [2022-04-28 08:20:13,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2101240716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:13,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:13,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:13,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414168973] [2022-04-28 08:20:13,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:13,443 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 08:20:13,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:13,444 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 08:20:13,457 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 08:20:13,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:13,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:13,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:13,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:13,460 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:13,600 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-04-28 08:20:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:13,600 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 08:20:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:13,601 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 08:20:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 08:20:13,602 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 08:20:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 08:20:13,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-28 08:20:13,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:13,696 INFO L225 Difference]: With dead ends: 148 [2022-04-28 08:20:13,696 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 08:20:13,696 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 08:20:13,697 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:13,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 08:20:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-28 08:20:13,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:13,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,707 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,707 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:13,710 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-28 08:20:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-28 08:20:13,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:13,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:13,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 08:20:13,711 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 08:20:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:13,714 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-28 08:20:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-28 08:20:13,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:13,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:13,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:13,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-04-28 08:20:13,717 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-04-28 08:20:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:13,717 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-04-28 08:20:13,718 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 08:20:13,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 165 transitions. [2022-04-28 08:20:13,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-04-28 08:20:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:20:13,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:13,842 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 08:20:13,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:20:13,842 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-04-28 08:20:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207273519] [2022-04-28 08:20:13,843 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 2 times [2022-04-28 08:20:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:13,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390905870] [2022-04-28 08:20:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:13,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:13,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1895#true} is VALID [2022-04-28 08:20:13,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 08:20:13,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #149#return; {1895#true} is VALID [2022-04-28 08:20:13,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:13,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1895#true} is VALID [2022-04-28 08:20:13,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 08:20:13,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #149#return; {1895#true} is VALID [2022-04-28 08:20:13,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret12 := main(); {1895#true} is VALID [2022-04-28 08:20:13,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {1895#true} is VALID [2022-04-28 08:20:13,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1895#true} is VALID [2022-04-28 08:20:13,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1895#true} is VALID [2022-04-28 08:20:13,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} assume !(0 != ~p1~0); {1895#true} is VALID [2022-04-28 08:20:13,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#true} assume 0 != ~p2~0;~lk2~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-28 08:20:13,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-28 08:20:13,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-28 08:20:13,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-28 08:20:13,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-28 08:20:13,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-28 08:20:13,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1900#(= main_~lk2~0 1)} is VALID [2022-04-28 08:20:13,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1900#(= main_~lk2~0 1)} is VALID [2022-04-28 08:20:13,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1896#false} is VALID [2022-04-28 08:20:13,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-28 08:20:13,905 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 08:20:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:13,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390905870] [2022-04-28 08:20:13,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390905870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:13,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:13,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:13,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:13,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207273519] [2022-04-28 08:20:13,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207273519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:13,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:13,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:13,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588116917] [2022-04-28 08:20:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:13,906 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 08:20:13,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:13,907 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 08:20:13,918 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 08:20:13,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:13,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:13,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:13,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:13,919 INFO L87 Difference]: Start difference. First operand 99 states and 165 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:14,047 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-04-28 08:20:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:14,047 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 08:20:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:14,048 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 08:20:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 08:20:14,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 08:20:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 08:20:14,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-28 08:20:14,107 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 08:20:14,109 INFO L225 Difference]: With dead ends: 127 [2022-04-28 08:20:14,109 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 08:20:14,110 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 08:20:14,110 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:14,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 08:20:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-04-28 08:20:14,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:14,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,121 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,121 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:14,124 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-28 08:20:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-28 08:20:14,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:14,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:14,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-28 08:20:14,125 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-28 08:20:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:14,128 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-28 08:20:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-28 08:20:14,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:14,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:14,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:14,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-04-28 08:20:14,132 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-04-28 08:20:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:14,132 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-04-28 08:20:14,132 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 08:20:14,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 163 transitions. [2022-04-28 08:20:14,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-04-28 08:20:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:20:14,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:14,259 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 08:20:14,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:20:14,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-04-28 08:20:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1965782359] [2022-04-28 08:20:14,260 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 2 times [2022-04-28 08:20:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612722015] [2022-04-28 08:20:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:14,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2609#true} is VALID [2022-04-28 08:20:14,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {2609#true} assume true; {2609#true} is VALID [2022-04-28 08:20:14,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2609#true} {2609#true} #149#return; {2609#true} is VALID [2022-04-28 08:20:14,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {2609#true} call ULTIMATE.init(); {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:14,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2609#true} is VALID [2022-04-28 08:20:14,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {2609#true} assume true; {2609#true} is VALID [2022-04-28 08:20:14,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2609#true} {2609#true} #149#return; {2609#true} is VALID [2022-04-28 08:20:14,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {2609#true} call #t~ret12 := main(); {2609#true} is VALID [2022-04-28 08:20:14,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {2609#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {2609#true} is VALID [2022-04-28 08:20:14,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {2609#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2609#true} is VALID [2022-04-28 08:20:14,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {2609#true} is VALID [2022-04-28 08:20:14,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {2609#true} assume !(0 != ~p1~0); {2609#true} is VALID [2022-04-28 08:20:14,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {2609#true} assume !(0 != ~p2~0); {2609#true} is VALID [2022-04-28 08:20:14,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {2609#true} assume 0 != ~p3~0;~lk3~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-28 08:20:14,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-28 08:20:14,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-28 08:20:14,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-28 08:20:14,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-28 08:20:14,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2614#(= main_~lk3~0 1)} is VALID [2022-04-28 08:20:14,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {2614#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2614#(= main_~lk3~0 1)} is VALID [2022-04-28 08:20:14,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2614#(= main_~lk3~0 1)} is VALID [2022-04-28 08:20:14,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2610#false} is VALID [2022-04-28 08:20:14,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {2610#false} assume !false; {2610#false} is VALID [2022-04-28 08:20:14,329 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 08:20:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:14,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612722015] [2022-04-28 08:20:14,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612722015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:14,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:14,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:14,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:14,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1965782359] [2022-04-28 08:20:14,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1965782359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:14,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:14,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355224310] [2022-04-28 08:20:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:14,330 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 08:20:14,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:14,331 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 08:20:14,342 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 08:20:14,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:14,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:14,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:14,342 INFO L87 Difference]: Start difference. First operand 99 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:14,446 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-04-28 08:20:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:14,446 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 08:20:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:14,446 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 08:20:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 08:20:14,447 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 08:20:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 08:20:14,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 08:20:14,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:14,504 INFO L225 Difference]: With dead ends: 179 [2022-04-28 08:20:14,504 INFO L226 Difference]: Without dead ends: 177 [2022-04-28 08:20:14,505 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 08:20:14,505 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:14,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-28 08:20:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-04-28 08:20:14,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:14,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,517 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,517 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:14,521 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-28 08:20:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-28 08:20:14,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:14,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:14,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-28 08:20:14,522 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-28 08:20:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:14,526 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-28 08:20:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-28 08:20:14,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:14,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:14,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:14,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-04-28 08:20:14,529 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-04-28 08:20:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:14,530 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-04-28 08:20:14,530 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 08:20:14,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 221 transitions. [2022-04-28 08:20:14,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-04-28 08:20:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:20:14,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:14,707 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 08:20:14,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:20:14,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:14,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-04-28 08:20:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:14,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449240775] [2022-04-28 08:20:14,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 2 times [2022-04-28 08:20:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:14,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955100617] [2022-04-28 08:20:14,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:14,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {3609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3603#true} is VALID [2022-04-28 08:20:14,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {3603#true} assume true; {3603#true} is VALID [2022-04-28 08:20:14,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3603#true} {3603#true} #149#return; {3603#true} is VALID [2022-04-28 08:20:14,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {3603#true} call ULTIMATE.init(); {3609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:14,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {3609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3603#true} is VALID [2022-04-28 08:20:14,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {3603#true} assume true; {3603#true} is VALID [2022-04-28 08:20:14,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3603#true} {3603#true} #149#return; {3603#true} is VALID [2022-04-28 08:20:14,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {3603#true} call #t~ret12 := main(); {3603#true} is VALID [2022-04-28 08:20:14,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {3603#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {3603#true} is VALID [2022-04-28 08:20:14,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {3603#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3603#true} is VALID [2022-04-28 08:20:14,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {3603#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {3603#true} is VALID [2022-04-28 08:20:14,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {3603#true} assume !(0 != ~p1~0); {3603#true} is VALID [2022-04-28 08:20:14,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {3603#true} assume !(0 != ~p2~0); {3603#true} is VALID [2022-04-28 08:20:14,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {3603#true} assume !(0 != ~p3~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-28 08:20:14,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-28 08:20:14,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-28 08:20:14,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-28 08:20:14,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-28 08:20:14,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {3608#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-28 08:20:14,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {3608#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-28 08:20:14,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p3~0; {3604#false} is VALID [2022-04-28 08:20:14,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {3604#false} assume 1 != ~lk3~0; {3604#false} is VALID [2022-04-28 08:20:14,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {3604#false} assume !false; {3604#false} is VALID [2022-04-28 08:20:14,769 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 08:20:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:14,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955100617] [2022-04-28 08:20:14,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955100617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:14,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:14,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:14,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:14,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449240775] [2022-04-28 08:20:14,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449240775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:14,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:14,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68705462] [2022-04-28 08:20:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:14,770 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 08:20:14,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:14,770 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 08:20:14,781 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 08:20:14,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:14,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:14,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:14,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:14,782 INFO L87 Difference]: Start difference. First operand 135 states and 221 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:14,915 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-04-28 08:20:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:14,915 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 08:20:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:14,915 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 08:20:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-28 08:20:14,917 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 08:20:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-28 08:20:14,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-04-28 08:20:15,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:15,006 INFO L225 Difference]: With dead ends: 311 [2022-04-28 08:20:15,006 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 08:20:15,007 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 08:20:15,007 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:15,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 08:20:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-28 08:20:15,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:15,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,021 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,021 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:15,025 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-28 08:20:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-28 08:20:15,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:15,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:15,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-28 08:20:15,041 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-28 08:20:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:15,045 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-28 08:20:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-28 08:20:15,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:15,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:15,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:15,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-04-28 08:20:15,051 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-04-28 08:20:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:15,051 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-04-28 08:20:15,051 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 08:20:15,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 295 transitions. [2022-04-28 08:20:15,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-04-28 08:20:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:20:15,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:15,319 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, 1] [2022-04-28 08:20:15,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:20:15,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-04-28 08:20:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:15,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1370916259] [2022-04-28 08:20:15,320 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 2 times [2022-04-28 08:20:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:15,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470113098] [2022-04-28 08:20:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:15,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:15,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {4979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4973#true} is VALID [2022-04-28 08:20:15,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-28 08:20:15,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4973#true} {4973#true} #149#return; {4973#true} is VALID [2022-04-28 08:20:15,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:15,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4973#true} is VALID [2022-04-28 08:20:15,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-28 08:20:15,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #149#return; {4973#true} is VALID [2022-04-28 08:20:15,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret12 := main(); {4973#true} is VALID [2022-04-28 08:20:15,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {4973#true} is VALID [2022-04-28 08:20:15,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4973#true} is VALID [2022-04-28 08:20:15,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {4973#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {4973#true} is VALID [2022-04-28 08:20:15,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {4973#true} assume !(0 != ~p1~0); {4973#true} is VALID [2022-04-28 08:20:15,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {4973#true} assume !(0 != ~p2~0); {4973#true} is VALID [2022-04-28 08:20:15,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {4973#true} assume 0 != ~p3~0;~lk3~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:20:15,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:20:15,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:20:15,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:20:15,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:20:15,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4978#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:20:15,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4978#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:20:15,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4974#false} is VALID [2022-04-28 08:20:15,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {4974#false} assume 0 != ~p4~0; {4974#false} is VALID [2022-04-28 08:20:15,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {4974#false} assume 1 != ~lk4~0; {4974#false} is VALID [2022-04-28 08:20:15,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-28 08:20:15,368 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 08:20:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:15,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470113098] [2022-04-28 08:20:15,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470113098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:15,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:15,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:15,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:15,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1370916259] [2022-04-28 08:20:15,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1370916259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:15,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:15,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:15,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693641334] [2022-04-28 08:20:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:15,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 08:20:15,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:15,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:15,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:15,381 INFO L87 Difference]: Start difference. First operand 183 states and 295 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:15,493 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-04-28 08:20:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:15,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 08:20:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 08:20:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 08:20:15,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 08:20:15,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:15,570 INFO L225 Difference]: With dead ends: 277 [2022-04-28 08:20:15,570 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 08:20:15,570 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 08:20:15,571 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:15,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 08:20:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-04-28 08:20:15,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:15,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,583 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,583 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:15,586 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-28 08:20:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-28 08:20:15,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:15,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:15,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-28 08:20:15,587 INFO L87 Difference]: Start difference. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-28 08:20:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:15,590 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-28 08:20:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-28 08:20:15,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:15,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:15,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:15,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-04-28 08:20:15,594 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-04-28 08:20:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:15,594 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-04-28 08:20:15,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 299 transitions. [2022-04-28 08:20:15,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-04-28 08:20:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:20:15,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:15,858 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, 1] [2022-04-28 08:20:15,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:20:15,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-04-28 08:20:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:15,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377212965] [2022-04-28 08:20:15,859 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 2 times [2022-04-28 08:20:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:15,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766830850] [2022-04-28 08:20:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:15,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {6305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6299#true} is VALID [2022-04-28 08:20:15,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {6299#true} assume true; {6299#true} is VALID [2022-04-28 08:20:15,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6299#true} {6299#true} #149#return; {6299#true} is VALID [2022-04-28 08:20:15,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:15,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6299#true} is VALID [2022-04-28 08:20:15,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2022-04-28 08:20:15,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #149#return; {6299#true} is VALID [2022-04-28 08:20:15,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret12 := main(); {6299#true} is VALID [2022-04-28 08:20:15,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {6299#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {6299#true} is VALID [2022-04-28 08:20:15,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {6299#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {6299#true} is VALID [2022-04-28 08:20:15,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {6299#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {6299#true} is VALID [2022-04-28 08:20:15,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {6299#true} assume !(0 != ~p1~0); {6299#true} is VALID [2022-04-28 08:20:15,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {6299#true} assume !(0 != ~p2~0); {6299#true} is VALID [2022-04-28 08:20:15,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {6299#true} assume !(0 != ~p3~0); {6299#true} is VALID [2022-04-28 08:20:15,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {6299#true} assume 0 != ~p4~0;~lk4~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-28 08:20:15,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-28 08:20:15,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-28 08:20:15,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-28 08:20:15,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-28 08:20:15,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-28 08:20:15,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-28 08:20:15,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p4~0; {6304#(= main_~lk4~0 1)} is VALID [2022-04-28 08:20:15,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {6304#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {6300#false} is VALID [2022-04-28 08:20:15,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2022-04-28 08:20:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:20:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:15,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766830850] [2022-04-28 08:20:15,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766830850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:15,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:15,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:15,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:15,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377212965] [2022-04-28 08:20:15,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377212965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:15,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:15,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742367761] [2022-04-28 08:20:15,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:15,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 08:20:15,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:15,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:15,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:15,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:15,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:15,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:15,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:15,925 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:16,037 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-04-28 08:20:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:16,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 08:20:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 08:20:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 08:20:16,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-28 08:20:16,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:16,102 INFO L225 Difference]: With dead ends: 333 [2022-04-28 08:20:16,102 INFO L226 Difference]: Without dead ends: 331 [2022-04-28 08:20:16,102 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 08:20:16,104 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:16,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-28 08:20:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-04-28 08:20:16,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:16,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,124 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,125 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:16,147 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-28 08:20:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-28 08:20:16,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:16,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:16,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-28 08:20:16,160 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-28 08:20:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:16,166 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-28 08:20:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-28 08:20:16,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:16,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:16,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:16,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-04-28 08:20:16,173 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-04-28 08:20:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:16,173 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-04-28 08:20:16,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 411 transitions. [2022-04-28 08:20:16,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-04-28 08:20:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:20:16,529 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:16,529 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, 1] [2022-04-28 08:20:16,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:20:16,529 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-04-28 08:20:16,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:16,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496977801] [2022-04-28 08:20:16,530 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:16,530 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 2 times [2022-04-28 08:20:16,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:16,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112819911] [2022-04-28 08:20:16,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:16,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:16,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:16,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {8175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8169#true} is VALID [2022-04-28 08:20:16,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-28 08:20:16,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8169#true} {8169#true} #149#return; {8169#true} is VALID [2022-04-28 08:20:16,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:16,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {8175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8169#true} is VALID [2022-04-28 08:20:16,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-28 08:20:16,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #149#return; {8169#true} is VALID [2022-04-28 08:20:16,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret12 := main(); {8169#true} is VALID [2022-04-28 08:20:16,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {8169#true} is VALID [2022-04-28 08:20:16,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {8169#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {8169#true} is VALID [2022-04-28 08:20:16,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {8169#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {8169#true} is VALID [2022-04-28 08:20:16,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {8169#true} assume !(0 != ~p1~0); {8169#true} is VALID [2022-04-28 08:20:16,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {8169#true} assume !(0 != ~p2~0); {8169#true} is VALID [2022-04-28 08:20:16,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {8169#true} assume !(0 != ~p3~0); {8169#true} is VALID [2022-04-28 08:20:16,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {8169#true} assume !(0 != ~p4~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-28 08:20:16,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-28 08:20:16,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-28 08:20:16,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-28 08:20:16,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p1~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-28 08:20:16,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p2~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-28 08:20:16,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p3~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-28 08:20:16,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p4~0; {8170#false} is VALID [2022-04-28 08:20:16,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume 1 != ~lk4~0; {8170#false} is VALID [2022-04-28 08:20:16,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-28 08:20:16,581 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 08:20:16,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:16,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112819911] [2022-04-28 08:20:16,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112819911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:16,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:16,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:16,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:16,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1496977801] [2022-04-28 08:20:16,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1496977801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:16,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:16,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392066678] [2022-04-28 08:20:16,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 08:20:16,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:16,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:16,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:16,596 INFO L87 Difference]: Start difference. First operand 265 states and 411 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:16,743 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-04-28 08:20:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:16,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 08:20:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-28 08:20:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-28 08:20:16,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 129 transitions. [2022-04-28 08:20:16,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:16,825 INFO L225 Difference]: With dead ends: 605 [2022-04-28 08:20:16,825 INFO L226 Difference]: Without dead ends: 355 [2022-04-28 08:20:16,826 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 08:20:16,826 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:16,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-28 08:20:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-04-28 08:20:16,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:16,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,849 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,849 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:16,856 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-28 08:20:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-28 08:20:16,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:16,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:16,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-28 08:20:16,858 INFO L87 Difference]: Start difference. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-28 08:20:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:16,868 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-28 08:20:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-28 08:20:16,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:16,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:16,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:16,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-04-28 08:20:16,880 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-04-28 08:20:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:16,881 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-04-28 08:20:16,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:16,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 353 states and 535 transitions. [2022-04-28 08:20:17,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-04-28 08:20:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:20:17,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:17,349 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, 1, 1] [2022-04-28 08:20:17,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:20:17,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-04-28 08:20:17,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:17,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927219634] [2022-04-28 08:20:17,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 2 times [2022-04-28 08:20:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:17,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148079116] [2022-04-28 08:20:17,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:17,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:17,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {10813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10807#true} is VALID [2022-04-28 08:20:17,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-28 08:20:17,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10807#true} {10807#true} #149#return; {10807#true} is VALID [2022-04-28 08:20:17,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {10807#true} call ULTIMATE.init(); {10813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:17,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {10813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10807#true} is VALID [2022-04-28 08:20:17,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-28 08:20:17,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10807#true} {10807#true} #149#return; {10807#true} is VALID [2022-04-28 08:20:17,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {10807#true} call #t~ret12 := main(); {10807#true} is VALID [2022-04-28 08:20:17,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {10807#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {10807#true} is VALID [2022-04-28 08:20:17,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {10807#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {10807#true} is VALID [2022-04-28 08:20:17,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {10807#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {10807#true} is VALID [2022-04-28 08:20:17,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {10807#true} assume !(0 != ~p1~0); {10807#true} is VALID [2022-04-28 08:20:17,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {10807#true} assume !(0 != ~p2~0); {10807#true} is VALID [2022-04-28 08:20:17,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {10807#true} assume !(0 != ~p3~0); {10807#true} is VALID [2022-04-28 08:20:17,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {10807#true} assume 0 != ~p4~0;~lk4~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:20:17,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:20:17,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:20:17,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:20:17,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:20:17,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:20:17,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:20:17,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {10808#false} is VALID [2022-04-28 08:20:17,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {10808#false} assume 0 != ~p5~0; {10808#false} is VALID [2022-04-28 08:20:17,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {10808#false} assume 1 != ~lk5~0; {10808#false} is VALID [2022-04-28 08:20:17,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {10808#false} assume !false; {10808#false} is VALID [2022-04-28 08:20:17,400 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 08:20:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:17,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148079116] [2022-04-28 08:20:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148079116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:17,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:17,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:17,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:17,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927219634] [2022-04-28 08:20:17,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927219634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:17,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:17,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778184654] [2022-04-28 08:20:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:17,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:20:17,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:17,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:17,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:17,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:17,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:17,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:17,414 INFO L87 Difference]: Start difference. First operand 353 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:17,547 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-04-28 08:20:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:17,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:20:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-28 08:20:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-28 08:20:17,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-28 08:20:17,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:17,626 INFO L225 Difference]: With dead ends: 529 [2022-04-28 08:20:17,627 INFO L226 Difference]: Without dead ends: 363 [2022-04-28 08:20:17,627 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 08:20:17,627 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:17,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-28 08:20:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-04-28 08:20:17,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:17,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,648 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,648 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:17,655 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-28 08:20:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-28 08:20:17,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:17,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:17,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-28 08:20:17,657 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-28 08:20:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:17,664 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-28 08:20:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-28 08:20:17,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:17,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:17,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:17,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-04-28 08:20:17,672 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-04-28 08:20:17,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:17,672 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-04-28 08:20:17,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:17,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 535 transitions. [2022-04-28 08:20:18,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-04-28 08:20:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:20:18,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:18,132 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, 1, 1] [2022-04-28 08:20:18,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:20:18,133 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-04-28 08:20:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:18,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [842218914] [2022-04-28 08:20:18,134 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 2 times [2022-04-28 08:20:18,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:18,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838890055] [2022-04-28 08:20:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:18,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:18,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:18,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13325#true} is VALID [2022-04-28 08:20:18,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {13325#true} assume true; {13325#true} is VALID [2022-04-28 08:20:18,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13325#true} {13325#true} #149#return; {13325#true} is VALID [2022-04-28 08:20:18,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {13325#true} call ULTIMATE.init(); {13331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:18,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {13325#true} assume true; {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13325#true} {13325#true} #149#return; {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {13325#true} call #t~ret12 := main(); {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {13325#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {13325#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {13325#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {13325#true} assume !(0 != ~p1~0); {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {13325#true} assume !(0 != ~p2~0); {13325#true} is VALID [2022-04-28 08:20:18,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {13325#true} assume !(0 != ~p3~0); {13325#true} is VALID [2022-04-28 08:20:18,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {13325#true} assume !(0 != ~p4~0); {13325#true} is VALID [2022-04-28 08:20:18,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {13325#true} assume 0 != ~p5~0;~lk5~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-28 08:20:18,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-28 08:20:18,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-28 08:20:18,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-28 08:20:18,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-28 08:20:18,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-28 08:20:18,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-28 08:20:18,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p5~0; {13330#(= main_~lk5~0 1)} is VALID [2022-04-28 08:20:18,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {13330#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {13326#false} is VALID [2022-04-28 08:20:18,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {13326#false} assume !false; {13326#false} is VALID [2022-04-28 08:20:18,201 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 08:20:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:18,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838890055] [2022-04-28 08:20:18,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838890055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:18,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:18,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:18,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:18,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [842218914] [2022-04-28 08:20:18,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [842218914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:18,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:18,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:18,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830701505] [2022-04-28 08:20:18,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:18,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:20:18,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:18,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:18,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:18,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:18,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:18,216 INFO L87 Difference]: Start difference. First operand 361 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:18,367 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-04-28 08:20:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:20:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-28 08:20:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-28 08:20:18,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-28 08:20:18,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:18,430 INFO L225 Difference]: With dead ends: 621 [2022-04-28 08:20:18,430 INFO L226 Difference]: Without dead ends: 619 [2022-04-28 08:20:18,430 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 08:20:18,431 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:18,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-28 08:20:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-04-28 08:20:18,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:18,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,461 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,462 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:18,491 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-28 08:20:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-28 08:20:18,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:18,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:18,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-28 08:20:18,494 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-28 08:20:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:18,509 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-28 08:20:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-28 08:20:18,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:18,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:18,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:18,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-04-28 08:20:18,528 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-04-28 08:20:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:18,528 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-04-28 08:20:18,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:18,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 751 transitions. [2022-04-28 08:20:19,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 751 edges. 751 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-04-28 08:20:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:20:19,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:19,238 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, 1, 1] [2022-04-28 08:20:19,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:20:19,238 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:19,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-04-28 08:20:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:19,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1139279581] [2022-04-28 08:20:19,239 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 2 times [2022-04-28 08:20:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:19,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65572215] [2022-04-28 08:20:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:19,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {16865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {16859#true} is VALID [2022-04-28 08:20:19,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {16859#true} assume true; {16859#true} is VALID [2022-04-28 08:20:19,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16859#true} {16859#true} #149#return; {16859#true} is VALID [2022-04-28 08:20:19,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {16859#true} call ULTIMATE.init(); {16865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {16865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {16859#true} assume true; {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16859#true} {16859#true} #149#return; {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {16859#true} call #t~ret12 := main(); {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {16859#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {16859#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {16859#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {16859#true} assume !(0 != ~p1~0); {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {16859#true} assume !(0 != ~p2~0); {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {16859#true} assume !(0 != ~p3~0); {16859#true} is VALID [2022-04-28 08:20:19,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {16859#true} assume !(0 != ~p4~0); {16859#true} is VALID [2022-04-28 08:20:19,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {16859#true} assume !(0 != ~p5~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-28 08:20:19,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16864#(= main_~p5~0 0)} is VALID [2022-04-28 08:20:19,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16864#(= main_~p5~0 0)} is VALID [2022-04-28 08:20:19,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p1~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-28 08:20:19,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p2~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-28 08:20:19,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p3~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-28 08:20:19,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p4~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-28 08:20:19,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p5~0; {16860#false} is VALID [2022-04-28 08:20:19,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {16860#false} assume 1 != ~lk5~0; {16860#false} is VALID [2022-04-28 08:20:19,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {16860#false} assume !false; {16860#false} is VALID [2022-04-28 08:20:19,285 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 08:20:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:19,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65572215] [2022-04-28 08:20:19,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65572215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:19,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:19,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:19,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:19,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1139279581] [2022-04-28 08:20:19,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1139279581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:19,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:19,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26019545] [2022-04-28 08:20:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:20:19,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:19,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:19,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:19,299 INFO L87 Difference]: Start difference. First operand 521 states and 751 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:19,503 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-04-28 08:20:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:20:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-28 08:20:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-28 08:20:19,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-28 08:20:19,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:19,624 INFO L225 Difference]: With dead ends: 1181 [2022-04-28 08:20:19,624 INFO L226 Difference]: Without dead ends: 683 [2022-04-28 08:20:19,625 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 08:20:19,627 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:19,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-04-28 08:20:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-04-28 08:20:19,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:19,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,668 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,669 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:19,685 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-28 08:20:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-28 08:20:19,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:19,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:19,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 683 states. [2022-04-28 08:20:19,687 INFO L87 Difference]: Start difference. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 683 states. [2022-04-28 08:20:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:19,705 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-28 08:20:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-28 08:20:19,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:19,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:19,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:19,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-04-28 08:20:19,729 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-04-28 08:20:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:19,729 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-04-28 08:20:19,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 681 states and 951 transitions. [2022-04-28 08:20:20,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-04-28 08:20:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:20:20,587 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:20,588 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, 1, 1, 1] [2022-04-28 08:20:20,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:20:20,588 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:20,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-04-28 08:20:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:20,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1692627068] [2022-04-28 08:20:20,588 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 2 times [2022-04-28 08:20:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:20,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556860008] [2022-04-28 08:20:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:20,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {21967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21961#true} is VALID [2022-04-28 08:20:20,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {21961#true} assume true; {21961#true} is VALID [2022-04-28 08:20:20,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21961#true} {21961#true} #149#return; {21961#true} is VALID [2022-04-28 08:20:20,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {21961#true} call ULTIMATE.init(); {21967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:20,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {21967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21961#true} is VALID [2022-04-28 08:20:20,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {21961#true} assume true; {21961#true} is VALID [2022-04-28 08:20:20,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21961#true} {21961#true} #149#return; {21961#true} is VALID [2022-04-28 08:20:20,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {21961#true} call #t~ret12 := main(); {21961#true} is VALID [2022-04-28 08:20:20,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {21961#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {21961#true} is VALID [2022-04-28 08:20:20,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {21961#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {21961#true} is VALID [2022-04-28 08:20:20,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {21961#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {21961#true} is VALID [2022-04-28 08:20:20,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {21961#true} assume !(0 != ~p1~0); {21961#true} is VALID [2022-04-28 08:20:20,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {21961#true} assume !(0 != ~p2~0); {21961#true} is VALID [2022-04-28 08:20:20,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {21961#true} assume !(0 != ~p3~0); {21961#true} is VALID [2022-04-28 08:20:20,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {21961#true} assume !(0 != ~p4~0); {21961#true} is VALID [2022-04-28 08:20:20,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {21961#true} assume 0 != ~p5~0;~lk5~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:20:20,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {21966#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:20:20,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {21966#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:20:20,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:20:20,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:20:20,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:20:20,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:20:20,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {21962#false} is VALID [2022-04-28 08:20:20,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {21962#false} assume 0 != ~p6~0; {21962#false} is VALID [2022-04-28 08:20:20,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {21962#false} assume 1 != ~lk6~0; {21962#false} is VALID [2022-04-28 08:20:20,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {21962#false} assume !false; {21962#false} is VALID [2022-04-28 08:20:20,638 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 08:20:20,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:20,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556860008] [2022-04-28 08:20:20,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556860008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:20,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:20,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:20,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:20,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1692627068] [2022-04-28 08:20:20,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1692627068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:20,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:20,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:20,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592166457] [2022-04-28 08:20:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:20,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 08:20:20,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:20,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:20,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:20,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:20,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:20,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:20,652 INFO L87 Difference]: Start difference. First operand 681 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:20,845 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-04-28 08:20:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:20,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 08:20:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-28 08:20:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-28 08:20:20,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-04-28 08:20:20,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:20,935 INFO L225 Difference]: With dead ends: 1021 [2022-04-28 08:20:20,935 INFO L226 Difference]: Without dead ends: 699 [2022-04-28 08:20:20,936 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 08:20:20,937 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:20,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-28 08:20:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-28 08:20:20,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:20,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:20,979 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:20,979 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:20,997 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-28 08:20:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-28 08:20:20,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:20,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:20,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-28 08:20:21,000 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-28 08:20:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:21,019 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-28 08:20:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-28 08:20:21,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:21,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:21,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:21,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-04-28 08:20:21,045 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-04-28 08:20:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:21,046 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-04-28 08:20:21,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:21,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 951 transitions. [2022-04-28 08:20:21,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-04-28 08:20:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:20:21,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:21,918 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, 1, 1, 1] [2022-04-28 08:20:21,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:20:21,918 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:21,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-04-28 08:20:21,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:21,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195444504] [2022-04-28 08:20:21,919 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:21,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 2 times [2022-04-28 08:20:21,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:21,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583083811] [2022-04-28 08:20:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:21,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:21,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {26813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {26807#true} is VALID [2022-04-28 08:20:21,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {26807#true} assume true; {26807#true} is VALID [2022-04-28 08:20:21,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26807#true} {26807#true} #149#return; {26807#true} is VALID [2022-04-28 08:20:21,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {26807#true} call ULTIMATE.init(); {26813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:21,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {26813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {26807#true} is VALID [2022-04-28 08:20:21,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {26807#true} assume true; {26807#true} is VALID [2022-04-28 08:20:21,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26807#true} {26807#true} #149#return; {26807#true} is VALID [2022-04-28 08:20:21,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {26807#true} call #t~ret12 := main(); {26807#true} is VALID [2022-04-28 08:20:21,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {26807#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {26807#true} is VALID [2022-04-28 08:20:21,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {26807#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {26807#true} is VALID [2022-04-28 08:20:21,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {26807#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {26807#true} is VALID [2022-04-28 08:20:21,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {26807#true} assume !(0 != ~p1~0); {26807#true} is VALID [2022-04-28 08:20:21,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {26807#true} assume !(0 != ~p2~0); {26807#true} is VALID [2022-04-28 08:20:21,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {26807#true} assume !(0 != ~p3~0); {26807#true} is VALID [2022-04-28 08:20:21,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {26807#true} assume !(0 != ~p4~0); {26807#true} is VALID [2022-04-28 08:20:21,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {26807#true} assume !(0 != ~p5~0); {26807#true} is VALID [2022-04-28 08:20:21,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {26807#true} assume 0 != ~p6~0;~lk6~0 := 1; {26812#(= main_~lk6~0 1)} is VALID [2022-04-28 08:20:21,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {26812#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {26812#(= main_~lk6~0 1)} is VALID [2022-04-28 08:20:21,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-28 08:20:21,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-28 08:20:21,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-28 08:20:21,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-28 08:20:21,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-28 08:20:21,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {26812#(= main_~lk6~0 1)} assume 0 != ~p6~0; {26812#(= main_~lk6~0 1)} is VALID [2022-04-28 08:20:21,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {26812#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {26808#false} is VALID [2022-04-28 08:20:21,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {26808#false} assume !false; {26808#false} is VALID [2022-04-28 08:20:21,974 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 08:20:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:21,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583083811] [2022-04-28 08:20:21,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583083811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:21,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:21,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:21,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:21,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195444504] [2022-04-28 08:20:21,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195444504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:21,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:21,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629053617] [2022-04-28 08:20:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:21,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 08:20:21,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:21,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:21,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:21,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:21,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:21,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:21,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:21,986 INFO L87 Difference]: Start difference. First operand 697 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:22,216 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-04-28 08:20:22,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:22,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 08:20:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-28 08:20:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-28 08:20:22,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-28 08:20:22,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:22,316 INFO L225 Difference]: With dead ends: 1165 [2022-04-28 08:20:22,316 INFO L226 Difference]: Without dead ends: 1163 [2022-04-28 08:20:22,318 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 08:20:22,319 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:22,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-28 08:20:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-04-28 08:20:22,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:22,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:22,393 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:22,394 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:22,435 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-28 08:20:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-28 08:20:22,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:22,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:22,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-28 08:20:22,439 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-28 08:20:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:22,480 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-28 08:20:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-28 08:20:22,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:22,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:22,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:22,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-04-28 08:20:22,543 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-04-28 08:20:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:22,543 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-04-28 08:20:22,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:22,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1367 transitions. [2022-04-28 08:20:23,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1367 edges. 1367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-04-28 08:20:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:20:23,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:23,894 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, 1, 1, 1] [2022-04-28 08:20:23,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:20:23,895 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:23,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-04-28 08:20:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:23,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [740614638] [2022-04-28 08:20:23,895 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 2 times [2022-04-28 08:20:23,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:23,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242480678] [2022-04-28 08:20:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:23,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {33547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {33541#true} is VALID [2022-04-28 08:20:23,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {33541#true} assume true; {33541#true} is VALID [2022-04-28 08:20:23,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33541#true} {33541#true} #149#return; {33541#true} is VALID [2022-04-28 08:20:23,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {33541#true} call ULTIMATE.init(); {33547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:23,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {33547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {33541#true} is VALID [2022-04-28 08:20:23,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {33541#true} assume true; {33541#true} is VALID [2022-04-28 08:20:23,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33541#true} {33541#true} #149#return; {33541#true} is VALID [2022-04-28 08:20:23,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {33541#true} call #t~ret12 := main(); {33541#true} is VALID [2022-04-28 08:20:23,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {33541#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {33541#true} is VALID [2022-04-28 08:20:23,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {33541#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {33541#true} is VALID [2022-04-28 08:20:23,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {33541#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {33541#true} is VALID [2022-04-28 08:20:23,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {33541#true} assume !(0 != ~p1~0); {33541#true} is VALID [2022-04-28 08:20:23,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {33541#true} assume !(0 != ~p2~0); {33541#true} is VALID [2022-04-28 08:20:23,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {33541#true} assume !(0 != ~p3~0); {33541#true} is VALID [2022-04-28 08:20:23,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {33541#true} assume !(0 != ~p4~0); {33541#true} is VALID [2022-04-28 08:20:23,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {33541#true} assume !(0 != ~p5~0); {33541#true} is VALID [2022-04-28 08:20:23,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {33541#true} assume !(0 != ~p6~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-28 08:20:23,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {33546#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {33546#(= main_~p6~0 0)} is VALID [2022-04-28 08:20:23,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p1~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-28 08:20:23,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p2~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-28 08:20:23,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p3~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-28 08:20:23,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p4~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-28 08:20:23,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p5~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-28 08:20:23,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {33546#(= main_~p6~0 0)} assume 0 != ~p6~0; {33542#false} is VALID [2022-04-28 08:20:23,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {33542#false} assume 1 != ~lk6~0; {33542#false} is VALID [2022-04-28 08:20:23,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {33542#false} assume !false; {33542#false} is VALID [2022-04-28 08:20:23,943 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 08:20:23,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:23,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242480678] [2022-04-28 08:20:23,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242480678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:23,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:23,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:23,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:23,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [740614638] [2022-04-28 08:20:23,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [740614638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:23,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:23,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475728902] [2022-04-28 08:20:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:23,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 08:20:23,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:23,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:23,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:23,958 INFO L87 Difference]: Start difference. First operand 1033 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:24,396 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-04-28 08:20:24,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:24,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 08:20:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 08:20:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 08:20:24,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-28 08:20:24,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:24,528 INFO L225 Difference]: With dead ends: 2317 [2022-04-28 08:20:24,528 INFO L226 Difference]: Without dead ends: 1323 [2022-04-28 08:20:24,529 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 08:20:24,529 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:24,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-04-28 08:20:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-04-28 08:20:24,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:24,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:24,623 INFO L74 IsIncluded]: Start isIncluded. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:24,624 INFO L87 Difference]: Start difference. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:24,673 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-28 08:20:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-28 08:20:24,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:24,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:24,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1323 states. [2022-04-28 08:20:24,678 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1323 states. [2022-04-28 08:20:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:24,737 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-28 08:20:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-28 08:20:24,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:24,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:24,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:24,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-04-28 08:20:24,820 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-04-28 08:20:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:24,821 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-04-28 08:20:24,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:24,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1321 states and 1671 transitions. [2022-04-28 08:20:26,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-04-28 08:20:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:20:26,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:26,349 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, 1, 1, 1, 1] [2022-04-28 08:20:26,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:20:26,350 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-04-28 08:20:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:26,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89411679] [2022-04-28 08:20:26,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 2 times [2022-04-28 08:20:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:26,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336917443] [2022-04-28 08:20:26,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:26,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {43481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {43475#true} is VALID [2022-04-28 08:20:26,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {43475#true} assume true; {43475#true} is VALID [2022-04-28 08:20:26,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43475#true} {43475#true} #149#return; {43475#true} is VALID [2022-04-28 08:20:26,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {43475#true} call ULTIMATE.init(); {43481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:26,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {43481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {43475#true} is VALID [2022-04-28 08:20:26,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {43475#true} assume true; {43475#true} is VALID [2022-04-28 08:20:26,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43475#true} {43475#true} #149#return; {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {43475#true} call #t~ret12 := main(); {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {43475#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {43475#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {43475#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {43475#true} assume !(0 != ~p1~0); {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {43475#true} assume !(0 != ~p2~0); {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {43475#true} assume !(0 != ~p3~0); {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {43475#true} assume !(0 != ~p4~0); {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {43475#true} assume !(0 != ~p5~0); {43475#true} is VALID [2022-04-28 08:20:26,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {43475#true} assume 0 != ~p6~0;~lk6~0 := 1; {43480#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:20:26,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {43480#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {43480#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:20:26,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:20:26,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:20:26,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:20:26,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:20:26,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:20:26,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {43476#false} is VALID [2022-04-28 08:20:26,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {43476#false} assume 0 != ~p7~0; {43476#false} is VALID [2022-04-28 08:20:26,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {43476#false} assume 1 != ~lk7~0; {43476#false} is VALID [2022-04-28 08:20:26,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {43476#false} assume !false; {43476#false} is VALID [2022-04-28 08:20:26,386 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 08:20:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:26,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336917443] [2022-04-28 08:20:26,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336917443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:26,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:26,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:26,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:26,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89411679] [2022-04-28 08:20:26,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89411679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:26,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:26,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:26,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478301532] [2022-04-28 08:20:26,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 08:20:26,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:26,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:26,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:26,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:26,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:26,399 INFO L87 Difference]: Start difference. First operand 1321 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:26,771 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-04-28 08:20:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:26,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 08:20:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 08:20:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 08:20:26,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-28 08:20:26,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:26,909 INFO L225 Difference]: With dead ends: 1981 [2022-04-28 08:20:26,909 INFO L226 Difference]: Without dead ends: 1355 [2022-04-28 08:20:26,910 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 08:20:26,910 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:26,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-28 08:20:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-28 08:20:26,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:26,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:26,992 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:26,993 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:27,044 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-28 08:20:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-28 08:20:27,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:27,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:27,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-28 08:20:27,048 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-28 08:20:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:27,101 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-28 08:20:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-28 08:20:27,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:27,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:27,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:27,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-04-28 08:20:27,209 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-04-28 08:20:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:27,209 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-04-28 08:20:27,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:27,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 1671 transitions. [2022-04-28 08:20:28,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-04-28 08:20:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:20:28,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:28,801 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, 1, 1, 1, 1] [2022-04-28 08:20:28,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:20:28,801 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-04-28 08:20:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:28,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599433886] [2022-04-28 08:20:28,802 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 2 times [2022-04-28 08:20:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:28,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230256014] [2022-04-28 08:20:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:28,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {52871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {52865#true} is VALID [2022-04-28 08:20:28,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {52865#true} assume true; {52865#true} is VALID [2022-04-28 08:20:28,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52865#true} {52865#true} #149#return; {52865#true} is VALID [2022-04-28 08:20:28,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {52865#true} call ULTIMATE.init(); {52871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:28,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {52871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {52865#true} is VALID [2022-04-28 08:20:28,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {52865#true} assume true; {52865#true} is VALID [2022-04-28 08:20:28,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52865#true} {52865#true} #149#return; {52865#true} is VALID [2022-04-28 08:20:28,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {52865#true} call #t~ret12 := main(); {52865#true} is VALID [2022-04-28 08:20:28,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {52865#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {52865#true} is VALID [2022-04-28 08:20:28,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {52865#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {52865#true} is VALID [2022-04-28 08:20:28,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {52865#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {52865#true} is VALID [2022-04-28 08:20:28,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {52865#true} assume !(0 != ~p1~0); {52865#true} is VALID [2022-04-28 08:20:28,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {52865#true} assume !(0 != ~p2~0); {52865#true} is VALID [2022-04-28 08:20:28,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {52865#true} assume !(0 != ~p3~0); {52865#true} is VALID [2022-04-28 08:20:28,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {52865#true} assume !(0 != ~p4~0); {52865#true} is VALID [2022-04-28 08:20:28,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {52865#true} assume !(0 != ~p5~0); {52865#true} is VALID [2022-04-28 08:20:28,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {52865#true} assume !(0 != ~p6~0); {52865#true} is VALID [2022-04-28 08:20:28,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {52865#true} assume 0 != ~p7~0;~lk7~0 := 1; {52870#(= main_~lk7~0 1)} is VALID [2022-04-28 08:20:28,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-28 08:20:28,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-28 08:20:28,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-28 08:20:28,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-28 08:20:28,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-28 08:20:28,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-28 08:20:28,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {52870#(= main_~lk7~0 1)} assume 0 != ~p7~0; {52870#(= main_~lk7~0 1)} is VALID [2022-04-28 08:20:28,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {52870#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {52866#false} is VALID [2022-04-28 08:20:28,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {52866#false} assume !false; {52866#false} is VALID [2022-04-28 08:20:28,843 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 08:20:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:28,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230256014] [2022-04-28 08:20:28,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230256014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:28,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:28,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:28,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:28,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599433886] [2022-04-28 08:20:28,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599433886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:28,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:28,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976693780] [2022-04-28 08:20:28,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 08:20:28,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:28,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:28,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:28,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:28,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:28,857 INFO L87 Difference]: Start difference. First operand 1353 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:29,276 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-04-28 08:20:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 08:20:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 08:20:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 08:20:29,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-28 08:20:29,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:29,501 INFO L225 Difference]: With dead ends: 2187 [2022-04-28 08:20:29,502 INFO L226 Difference]: Without dead ends: 2185 [2022-04-28 08:20:29,502 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 08:20:29,502 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:29,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-04-28 08:20:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-04-28 08:20:29,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:29,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:29,640 INFO L74 IsIncluded]: Start isIncluded. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:29,641 INFO L87 Difference]: Start difference. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:29,765 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-28 08:20:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-28 08:20:29,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:29,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:29,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2185 states. [2022-04-28 08:20:29,771 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2185 states. [2022-04-28 08:20:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:29,898 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-28 08:20:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-28 08:20:29,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:29,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:29,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:29,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-04-28 08:20:30,121 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-04-28 08:20:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:30,122 INFO L495 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-04-28 08:20:30,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:30,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 2471 transitions. [2022-04-28 08:20:32,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2471 edges. 2471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-04-28 08:20:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:20:32,430 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:32,430 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, 1, 1, 1, 1] [2022-04-28 08:20:32,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:20:32,431 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:32,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-04-28 08:20:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:32,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628335229] [2022-04-28 08:20:32,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 2 times [2022-04-28 08:20:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:32,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050991060] [2022-04-28 08:20:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:32,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:32,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {65741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {65735#true} is VALID [2022-04-28 08:20:32,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {65735#true} assume true; {65735#true} is VALID [2022-04-28 08:20:32,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65735#true} {65735#true} #149#return; {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {65735#true} call ULTIMATE.init(); {65741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:32,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {65741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {65735#true} assume true; {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65735#true} {65735#true} #149#return; {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {65735#true} call #t~ret12 := main(); {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {65735#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {65735#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {65735#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {65735#true} assume !(0 != ~p1~0); {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {65735#true} assume !(0 != ~p2~0); {65735#true} is VALID [2022-04-28 08:20:32,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {65735#true} assume !(0 != ~p3~0); {65735#true} is VALID [2022-04-28 08:20:32,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {65735#true} assume !(0 != ~p4~0); {65735#true} is VALID [2022-04-28 08:20:32,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {65735#true} assume !(0 != ~p5~0); {65735#true} is VALID [2022-04-28 08:20:32,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {65735#true} assume !(0 != ~p6~0); {65735#true} is VALID [2022-04-28 08:20:32,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {65735#true} assume !(0 != ~p7~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-28 08:20:32,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p1~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-28 08:20:32,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p2~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-28 08:20:32,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p3~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-28 08:20:32,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p4~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-28 08:20:32,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p5~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-28 08:20:32,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p6~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-28 08:20:32,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {65740#(= main_~p7~0 0)} assume 0 != ~p7~0; {65736#false} is VALID [2022-04-28 08:20:32,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {65736#false} assume 1 != ~lk7~0; {65736#false} is VALID [2022-04-28 08:20:32,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {65736#false} assume !false; {65736#false} is VALID [2022-04-28 08:20:32,486 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 08:20:32,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:32,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050991060] [2022-04-28 08:20:32,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050991060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:32,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:32,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:32,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:32,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628335229] [2022-04-28 08:20:32,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628335229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:32,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:32,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:32,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271788463] [2022-04-28 08:20:32,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:32,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 08:20:32,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:32,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:32,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:32,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:32,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:32,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:32,502 INFO L87 Difference]: Start difference. First operand 2057 states and 2471 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:33,664 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-04-28 08:20:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:20:33,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 08:20:33,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:20:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 08:20:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 08:20:33,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-28 08:20:33,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:33,741 INFO L225 Difference]: With dead ends: 4553 [2022-04-28 08:20:33,741 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 08:20:33,746 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 08:20:33,747 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:20:33,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:20:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 08:20:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 08:20:33,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:20:33,748 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 08:20:33,748 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 08:20:33,748 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 08:20:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:33,748 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:20:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:20:33,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:33,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:33,748 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 08:20:33,748 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 08:20:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:33,748 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:20:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:20:33,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:33,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:33,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:33,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:33,749 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 08:20:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 08:20:33,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 08:20:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:33,749 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 08:20:33,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:33,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 08:20:33,749 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 08:20:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:20:33,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:33,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 08:20:33,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:20:33,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 08:21:04,229 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 08:21:04,230 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 08:21:04,230 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 08:21:04,230 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:21:04,230 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 08:21:04,230 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:21:04,230 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:21:04,230 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 08:21:04,230 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 08:21:04,230 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:21:04,231 INFO L895 garLoopResultBuilder]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse2 (= main_~p7~0 0)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse5 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse2 .cse7 .cse6) (and .cse4 .cse0 .cse1 .cse6) (and .cse5 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse6) (and .cse4 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse1 .cse2 .cse7 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse5 .cse0 .cse2 .cse6) (and .cse4 .cse1 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse6))) [2022-04-28 08:21:04,231 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2022-04-28 08:21:04,231 INFO L895 garLoopResultBuilder]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-28 08:21:04,231 INFO L895 garLoopResultBuilder]: At program point L69-1(lines 32 118) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-28 08:21:04,231 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse6 (= main_~p7~0 0)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse9 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse5) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5))) [2022-04-28 08:21:04,232 INFO L895 garLoopResultBuilder]: At program point L61-1(lines 32 118) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-28 08:21:04,232 INFO L902 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-04-28 08:21:04,232 INFO L902 garLoopResultBuilder]: At program point L53(lines 53 55) the Hoare annotation is: true [2022-04-28 08:21:04,232 INFO L895 garLoopResultBuilder]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 08:21:04,232 INFO L895 garLoopResultBuilder]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) [2022-04-28 08:21:04,232 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2022-04-28 08:21:04,232 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse2 (= main_~lk5~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5))) [2022-04-28 08:21:04,232 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2022-04-28 08:21:04,232 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-04-28 08:21:04,233 INFO L895 garLoopResultBuilder]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse8 .cse6 .cse3 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse7) (and .cse0 .cse2 .cse5 .cse7 .cse4) (and .cse0 .cse1 .cse9 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse3) (and .cse2 .cse5 .cse8 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse7 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse8 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse3 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse3) (and .cse5 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse9 .cse3) (and .cse1 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse8 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse9 .cse7) (and .cse5 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse7) (and .cse0 .cse1 .cse9 .cse6 .cse7) (and .cse2 .cse5 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse3 .cse4) (and .cse1 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse5 .cse3 .cse4))) [2022-04-28 08:21:04,233 INFO L902 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-04-28 08:21:04,233 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse9 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse10 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse10 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5) (and .cse6 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse6 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse6 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse10 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4 .cse9 .cse5) (and .cse0 .cse7 .cse1 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse10 .cse9 .cse5) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse10 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse9 .cse5))) [2022-04-28 08:21:04,233 INFO L895 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2022-04-28 08:21:04,233 INFO L895 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-04-28 08:21:04,234 INFO L895 garLoopResultBuilder]: At program point L73-1(lines 32 118) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-28 08:21:04,234 INFO L895 garLoopResultBuilder]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse3 (= main_~lk7~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse5 .cse2) (and .cse3 .cse0 .cse2) (and .cse0 .cse1 .cse4))) [2022-04-28 08:21:04,234 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-28 08:21:04,234 INFO L895 garLoopResultBuilder]: At program point L57-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-28 08:21:04,234 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (= main_~p6~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse5 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse0 .cse1 .cse2 .cse4) (and .cse6 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse7) (and .cse6 .cse1 .cse2 .cse5 .cse7))) [2022-04-28 08:21:04,234 INFO L895 garLoopResultBuilder]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse4 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse11 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse9 .cse1 .cse7 .cse11 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse6 .cse9 .cse7 .cse4 .cse8) (and .cse6 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse11) (and .cse6 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse11 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse4 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse4 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse11) (and .cse1 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse11 .cse8 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse8) (and .cse9 .cse1 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse4))) [2022-04-28 08:21:04,234 INFO L895 garLoopResultBuilder]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~lk7~0 1) (= main_~p7~0 0)) [2022-04-28 08:21:04,234 INFO L902 garLoopResultBuilder]: At program point L34(lines 34 36) the Hoare annotation is: true [2022-04-28 08:21:04,235 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse13 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse12 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse7 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse7 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse11 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse11 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse7 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse11) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse11 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse7 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12))) [2022-04-28 08:21:04,235 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (not (= main_~p6~0 0)))) (or (and (= main_~lk7~0 1) .cse0 .cse1) (and (= main_~p7~0 0) .cse0 .cse1))) [2022-04-28 08:21:04,240 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 08:21:04,242 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 08:21:04,253 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 08:21:04,253 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 08:21:04,304 INFO L163 areAnnotationChecker]: CFG has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 08:21:04,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:21:04 BoogieIcfgContainer [2022-04-28 08:21:04,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 08:21:04,311 INFO L158 Benchmark]: Toolchain (without parser) took 53260.74ms. Allocated memory was 176.2MB in the beginning and 638.6MB in the end (delta: 462.4MB). Free memory was 124.3MB in the beginning and 382.2MB in the end (delta: -257.9MB). Peak memory consumption was 367.0MB. Max. memory is 8.0GB. [2022-04-28 08:21:04,311 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory was 141.1MB in the beginning and 141.1MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:21:04,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.77ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 124.1MB in the beginning and 187.6MB in the end (delta: -63.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 08:21:04,311 INFO L158 Benchmark]: Boogie Preprocessor took 20.67ms. Allocated memory is still 211.8MB. Free memory was 187.6MB in the beginning and 185.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 08:21:04,311 INFO L158 Benchmark]: RCFGBuilder took 356.52ms. Allocated memory is still 211.8MB. Free memory was 185.9MB in the beginning and 172.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 08:21:04,311 INFO L158 Benchmark]: TraceAbstraction took 52678.18ms. Allocated memory was 211.8MB in the beginning and 638.6MB in the end (delta: 426.8MB). Free memory was 172.3MB in the beginning and 382.2MB in the end (delta: -209.9MB). Peak memory consumption was 379.8MB. Max. memory is 8.0GB. [2022-04-28 08:21:04,312 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.11ms. Allocated memory is still 176.2MB. Free memory was 141.1MB in the beginning and 141.1MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.77ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 124.1MB in the beginning and 187.6MB in the end (delta: -63.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.67ms. Allocated memory is still 211.8MB. Free memory was 187.6MB in the beginning and 185.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 356.52ms. Allocated memory is still 211.8MB. Free memory was 185.9MB in the beginning and 172.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 52678.18ms. Allocated memory was 211.8MB in the beginning and 638.6MB in the end (delta: 426.8MB). Free memory was 172.3MB in the beginning and 382.2MB in the end (delta: -209.9MB). Peak memory consumption was 379.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1206 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 2605 NumberOfFragments, 9766 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 12.4s HoareSimplificationTime, 36 FomulaSimplificationsInter, 148195 FormulaSimplificationTreeSizeReductionInter, 18.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 08:21:04,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...