/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:19:34,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:19:34,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:19:34,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:19:34,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:19:34,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:19:34,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:19:34,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:19:34,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:19:34,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:19:34,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:19:34,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:19:34,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:19:34,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:19:34,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:19:34,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:19:34,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:19:34,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:19:34,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:19:34,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:19:34,123 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:19:34,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:19:34,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:19:34,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:19:34,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:19:34,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:19:34,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:19:34,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:19:34,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:19:34,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:19:34,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:19:34,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:19:34,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:19:34,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:19:34,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:19:34,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:19:34,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:19:34,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:19:34,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:19:34,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:19:34,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:19:34,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:19:34,135 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:19:34,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:19:34,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:19:34,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:19:34,142 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:19:34,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:19:34,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:19:34,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:19:34,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:19:34,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:19:34,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:19:34,143 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:19:34,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:19:34,143 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:19:34,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:19:34,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:19:34,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:19:34,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:19:34,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:19:34,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:19:34,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:19:34,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:19:34,144 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:19:34,144 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:19:34,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:19:34,145 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:19:34,145 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:19:34,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:19:34,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:19:34,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:19:34,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:19:34,320 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:19:34,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-04-28 08:19:34,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3508d71c0/6bc22bea848d4eb2b67a3136d1ef115d/FLAG7ec5a56ba [2022-04-28 08:19:34,755 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:19:34,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-04-28 08:19:34,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3508d71c0/6bc22bea848d4eb2b67a3136d1ef115d/FLAG7ec5a56ba [2022-04-28 08:19:35,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3508d71c0/6bc22bea848d4eb2b67a3136d1ef115d [2022-04-28 08:19:35,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:19:35,200 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:19:35,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:19:35,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:19:35,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:19:35,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e4ac47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35, skipping insertion in model container [2022-04-28 08:19:35,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:19:35,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:19:35,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2022-04-28 08:19:35,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:19:35,370 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:19:35,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2022-04-28 08:19:35,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:19:35,396 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:19:35,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35 WrapperNode [2022-04-28 08:19:35,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:19:35,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:19:35,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:19:35,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:19:35,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:19:35,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:19:35,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:19:35,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:19:35,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (1/1) ... [2022-04-28 08:19:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:19:35,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:19:35,462 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:19:35,491 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:19:35,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:19:35,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:19:35,502 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:19:35,502 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:19:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:19:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:19:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:19:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:19:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:19:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:19:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:19:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:19:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:19:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:19:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:19:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:19:35,547 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:19:35,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:19:35,686 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:19:35,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:19:35,692 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:19:35,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:19:35 BoogieIcfgContainer [2022-04-28 08:19:35,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:19:35,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:19:35,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:19:35,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:19:35,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:19:35" (1/3) ... [2022-04-28 08:19:35,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2835b427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:19:35, skipping insertion in model container [2022-04-28 08:19:35,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:35" (2/3) ... [2022-04-28 08:19:35,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2835b427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:19:35, skipping insertion in model container [2022-04-28 08:19:35,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:19:35" (3/3) ... [2022-04-28 08:19:35,698 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-04-28 08:19:35,707 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:19:35,707 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:19:35,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:19:35,745 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@98f9cc5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@595c13fe [2022-04-28 08:19:35,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:19:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:19:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 08:19:35,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:35,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:35,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:35,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:35,759 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-04-28 08:19:35,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:35,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294235979] [2022-04-28 08:19:35,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 2 times [2022-04-28 08:19:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:35,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046880688] [2022-04-28 08:19:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:35,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-28 08:19:35,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 08:19:35,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-28 08:19:35,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:35,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-28 08:19:35,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 08:19:35,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-28 08:19:35,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret10 := main(); {33#true} is VALID [2022-04-28 08:19:35,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {33#true} is VALID [2022-04-28 08:19:36,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {33#true} is VALID [2022-04-28 08:19:36,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {33#true} is VALID [2022-04-28 08:19:36,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 != ~p1~0;~lk1~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:36,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {38#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:36,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:36,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:36,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:36,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p1~0; {38#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:36,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {34#false} is VALID [2022-04-28 08:19:36,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 08:19:36,009 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:19:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:36,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046880688] [2022-04-28 08:19:36,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046880688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:36,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:36,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:36,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:36,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294235979] [2022-04-28 08:19:36,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294235979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:36,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:36,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:36,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257871697] [2022-04-28 08:19:36,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:36,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 08:19:36,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:36,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:36,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:36,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:36,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:36,068 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:36,288 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-04-28 08:19:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:36,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 08:19:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 08:19:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 08:19:36,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 08:19:36,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:36,387 INFO L225 Difference]: With dead ends: 58 [2022-04-28 08:19:36,387 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 08:19:36,389 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:19:36,391 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:36,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 08:19:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-28 08:19:36,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:36,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,413 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,413 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:36,416 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-28 08:19:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-28 08:19:36,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:36,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:36,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 08:19:36,417 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 08:19:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:36,434 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-28 08:19:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-28 08:19:36,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:36,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:36,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:36,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-28 08:19:36,437 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-04-28 08:19:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:36,437 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-04-28 08:19:36,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 50 transitions. [2022-04-28 08:19:36,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-04-28 08:19:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 08:19:36,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:36,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:36,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:19:36,478 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-04-28 08:19:36,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:36,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329072693] [2022-04-28 08:19:36,480 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 2 times [2022-04-28 08:19:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:36,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365550423] [2022-04-28 08:19:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:36,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-28 08:19:36,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 08:19:36,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #115#return; {309#true} is VALID [2022-04-28 08:19:36,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:36,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-28 08:19:36,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 08:19:36,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #115#return; {309#true} is VALID [2022-04-28 08:19:36,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret10 := main(); {309#true} is VALID [2022-04-28 08:19:36,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {309#true} is VALID [2022-04-28 08:19:36,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {309#true} is VALID [2022-04-28 08:19:36,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {309#true} is VALID [2022-04-28 08:19:36,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} assume !(0 != ~p1~0); {314#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:36,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(= main_~p1~0 0)} assume !(0 != ~p2~0); {314#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:36,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:36,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:36,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:36,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p1~0; {310#false} is VALID [2022-04-28 08:19:36,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {310#false} assume 1 != ~lk1~0; {310#false} is VALID [2022-04-28 08:19:36,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-28 08:19:36,553 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:19:36,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:36,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365550423] [2022-04-28 08:19:36,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365550423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:36,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:36,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:36,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:36,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329072693] [2022-04-28 08:19:36,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329072693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:36,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:36,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:36,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213256625] [2022-04-28 08:19:36,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:36,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 08:19:36,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:36,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:36,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:36,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:36,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:36,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:36,567 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:36,664 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-04-28 08:19:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:36,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 08:19:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-28 08:19:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-28 08:19:36,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-28 08:19:36,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:36,741 INFO L225 Difference]: With dead ends: 68 [2022-04-28 08:19:36,741 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 08:19:36,741 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:19:36,742 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:36,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 08:19:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-04-28 08:19:36,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:36,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,750 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,750 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:36,752 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-28 08:19:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-28 08:19:36,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:36,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:36,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 08:19:36,753 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 08:19:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:36,754 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-28 08:19:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-28 08:19:36,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:36,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:36,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:36,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-04-28 08:19:36,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-04-28 08:19:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:36,764 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-04-28 08:19:36,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 66 transitions. [2022-04-28 08:19:36,818 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:19:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-04-28 08:19:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:19:36,821 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:36,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:36,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:19:36,824 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-04-28 08:19:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:36,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1079355796] [2022-04-28 08:19:36,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 2 times [2022-04-28 08:19:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:36,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540241311] [2022-04-28 08:19:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:36,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {625#true} is VALID [2022-04-28 08:19:36,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 08:19:36,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #115#return; {625#true} is VALID [2022-04-28 08:19:36,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:36,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {625#true} is VALID [2022-04-28 08:19:36,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 08:19:36,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #115#return; {625#true} is VALID [2022-04-28 08:19:36,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret10 := main(); {625#true} is VALID [2022-04-28 08:19:36,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {625#true} is VALID [2022-04-28 08:19:36,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {625#true} is VALID [2022-04-28 08:19:36,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {625#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {625#true} is VALID [2022-04-28 08:19:36,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#true} assume 0 != ~p1~0;~lk1~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:36,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {630#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:36,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:36,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:36,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:36,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {626#false} is VALID [2022-04-28 08:19:36,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#false} assume 0 != ~p2~0; {626#false} is VALID [2022-04-28 08:19:36,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#false} assume 1 != ~lk2~0; {626#false} is VALID [2022-04-28 08:19:36,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-28 08:19:36,885 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:19:36,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:36,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540241311] [2022-04-28 08:19:36,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540241311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:36,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:36,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:36,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:36,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1079355796] [2022-04-28 08:19:36,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1079355796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:36,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:36,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:36,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406387929] [2022-04-28 08:19:36,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:36,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 08:19:36,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:36,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:36,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:36,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:36,897 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:36,986 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-28 08:19:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:36,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 08:19:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-28 08:19:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-28 08:19:36,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-28 08:19:37,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:37,050 INFO L225 Difference]: With dead ends: 64 [2022-04-28 08:19:37,050 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 08:19:37,050 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:19:37,053 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:37,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 08:19:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-28 08:19:37,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:37,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,068 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,068 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,071 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-28 08:19:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-28 08:19:37,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:37,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:37,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 08:19:37,074 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 08:19:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,079 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-28 08:19:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-28 08:19:37,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:37,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:37,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:37,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-04-28 08:19:37,082 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-04-28 08:19:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:37,084 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-04-28 08:19:37,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 68 transitions. [2022-04-28 08:19:37,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-04-28 08:19:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:19:37,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:37,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:37,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:19:37,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:37,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-04-28 08:19:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:37,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1076019514] [2022-04-28 08:19:37,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 2 times [2022-04-28 08:19:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:37,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979492723] [2022-04-28 08:19:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:37,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {945#true} is VALID [2022-04-28 08:19:37,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} assume true; {945#true} is VALID [2022-04-28 08:19:37,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {945#true} {945#true} #115#return; {945#true} is VALID [2022-04-28 08:19:37,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {945#true} call ULTIMATE.init(); {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:37,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {945#true} is VALID [2022-04-28 08:19:37,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} assume true; {945#true} is VALID [2022-04-28 08:19:37,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} #115#return; {945#true} is VALID [2022-04-28 08:19:37,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {945#true} call #t~ret10 := main(); {945#true} is VALID [2022-04-28 08:19:37,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {945#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {945#true} is VALID [2022-04-28 08:19:37,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {945#true} is VALID [2022-04-28 08:19:37,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {945#true} is VALID [2022-04-28 08:19:37,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#true} assume !(0 != ~p1~0); {945#true} is VALID [2022-04-28 08:19:37,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#true} assume !(0 != ~p2~0); {950#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:37,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:37,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:37,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:37,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= main_~p2~0 0)} assume !(0 != ~p1~0); {950#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:37,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p2~0; {946#false} is VALID [2022-04-28 08:19:37,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#false} assume 1 != ~lk2~0; {946#false} is VALID [2022-04-28 08:19:37,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#false} assume !false; {946#false} is VALID [2022-04-28 08:19:37,213 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:19:37,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:37,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979492723] [2022-04-28 08:19:37,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979492723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:37,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:37,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:37,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:37,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1076019514] [2022-04-28 08:19:37,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1076019514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:37,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:37,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620205990] [2022-04-28 08:19:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 08:19:37,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:37,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:37,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:37,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:37,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:37,226 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,323 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-04-28 08:19:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 08:19:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 08:19:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 08:19:37,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-28 08:19:37,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:37,393 INFO L225 Difference]: With dead ends: 112 [2022-04-28 08:19:37,394 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 08:19:37,394 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:19:37,395 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:37,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 08:19:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-28 08:19:37,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:37,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,409 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,410 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,411 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-28 08:19:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-28 08:19:37,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:37,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:37,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-28 08:19:37,413 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-28 08:19:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,417 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-28 08:19:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-28 08:19:37,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:37,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:37,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:37,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-04-28 08:19:37,419 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-04-28 08:19:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:37,420 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-04-28 08:19:37,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 117 transitions. [2022-04-28 08:19:37,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-04-28 08:19:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:19:37,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:37,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:37,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:19:37,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-04-28 08:19:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:37,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1859844501] [2022-04-28 08:19:37,502 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 2 times [2022-04-28 08:19:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761827297] [2022-04-28 08:19:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:37,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:37,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1485#true} is VALID [2022-04-28 08:19:37,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-28 08:19:37,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1485#true} {1485#true} #115#return; {1485#true} is VALID [2022-04-28 08:19:37,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {1485#true} call ULTIMATE.init(); {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:37,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1485#true} is VALID [2022-04-28 08:19:37,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-28 08:19:37,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1485#true} {1485#true} #115#return; {1485#true} is VALID [2022-04-28 08:19:37,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {1485#true} call #t~ret10 := main(); {1485#true} is VALID [2022-04-28 08:19:37,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {1485#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {1485#true} is VALID [2022-04-28 08:19:37,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {1485#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1485#true} is VALID [2022-04-28 08:19:37,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {1485#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1485#true} is VALID [2022-04-28 08:19:37,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {1485#true} assume !(0 != ~p1~0); {1485#true} is VALID [2022-04-28 08:19:37,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {1485#true} assume 0 != ~p2~0;~lk2~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:37,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:37,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:37,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:37,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {1490#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:37,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1490#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:37,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {1490#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1486#false} is VALID [2022-04-28 08:19:37,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {1486#false} assume !false; {1486#false} is VALID [2022-04-28 08:19:37,554 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:19:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761827297] [2022-04-28 08:19:37,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761827297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:37,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:37,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:37,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1859844501] [2022-04-28 08:19:37,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1859844501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:37,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:37,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610595889] [2022-04-28 08:19:37,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:37,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 08:19:37,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:37,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:37,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:37,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:37,567 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,648 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-04-28 08:19:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:37,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 08:19:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 08:19:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 08:19:37,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-28 08:19:37,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:37,694 INFO L225 Difference]: With dead ends: 95 [2022-04-28 08:19:37,694 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 08:19:37,694 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:19:37,695 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:37,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 08:19:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-04-28 08:19:37,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:37,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,711 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,712 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,715 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-28 08:19:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-28 08:19:37,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:37,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:37,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 08:19:37,716 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 08:19:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,718 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-28 08:19:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-28 08:19:37,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:37,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:37,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:37,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-04-28 08:19:37,720 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-04-28 08:19:37,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:37,720 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-04-28 08:19:37,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 115 transitions. [2022-04-28 08:19:37,811 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:19:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-04-28 08:19:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 08:19:37,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:37,811 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:19:37,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:19:37,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:37,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-04-28 08:19:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:37,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368066460] [2022-04-28 08:19:37,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 2 times [2022-04-28 08:19:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:37,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408066369] [2022-04-28 08:19:37,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:37,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {2029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2023#true} is VALID [2022-04-28 08:19:37,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {2023#true} assume true; {2023#true} is VALID [2022-04-28 08:19:37,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2023#true} {2023#true} #115#return; {2023#true} is VALID [2022-04-28 08:19:37,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {2023#true} call ULTIMATE.init(); {2029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:37,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {2029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2023#true} is VALID [2022-04-28 08:19:37,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {2023#true} assume true; {2023#true} is VALID [2022-04-28 08:19:37,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2023#true} {2023#true} #115#return; {2023#true} is VALID [2022-04-28 08:19:37,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {2023#true} call #t~ret10 := main(); {2023#true} is VALID [2022-04-28 08:19:37,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {2023#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {2023#true} is VALID [2022-04-28 08:19:37,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {2023#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2023#true} is VALID [2022-04-28 08:19:37,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {2023#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2023#true} is VALID [2022-04-28 08:19:37,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {2023#true} assume !(0 != ~p1~0); {2023#true} is VALID [2022-04-28 08:19:37,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {2023#true} assume !(0 != ~p2~0); {2023#true} is VALID [2022-04-28 08:19:37,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {2023#true} assume 0 != ~p3~0;~lk3~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:37,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:37,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:37,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:37,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:37,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2028#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:37,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {2028#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2024#false} is VALID [2022-04-28 08:19:37,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#false} assume !false; {2024#false} is VALID [2022-04-28 08:19:37,866 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:19:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:37,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408066369] [2022-04-28 08:19:37,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408066369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:37,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:37,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:37,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:37,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368066460] [2022-04-28 08:19:37,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368066460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:37,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:37,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811667501] [2022-04-28 08:19:37,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:37,868 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:19:37,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:37,868 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:19:37,877 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:19:37,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:37,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:37,878 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,963 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-04-28 08:19:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:37,963 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:19:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:37,964 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:19:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-28 08:19:37,965 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:19:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-28 08:19:37,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-04-28 08:19:38,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:38,003 INFO L225 Difference]: With dead ends: 131 [2022-04-28 08:19:38,003 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 08:19:38,003 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:19:38,005 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:38,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 08:19:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-04-28 08:19:38,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:38,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,021 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,021 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:38,024 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-28 08:19:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-28 08:19:38,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:38,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:38,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-28 08:19:38,025 INFO L87 Difference]: Start difference. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-28 08:19:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:38,028 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-28 08:19:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-28 08:19:38,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:38,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:38,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:38,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-04-28 08:19:38,032 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-04-28 08:19:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:38,032 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-04-28 08:19:38,032 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:19:38,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 157 transitions. [2022-04-28 08:19:38,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-04-28 08:19:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 08:19:38,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:38,166 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:19:38,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:19:38,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:38,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-04-28 08:19:38,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:38,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1542576166] [2022-04-28 08:19:38,167 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 2 times [2022-04-28 08:19:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:38,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168152269] [2022-04-28 08:19:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:38,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:38,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2761#true} is VALID [2022-04-28 08:19:38,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-04-28 08:19:38,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2761#true} {2761#true} #115#return; {2761#true} is VALID [2022-04-28 08:19:38,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {2761#true} call ULTIMATE.init(); {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:38,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2761#true} is VALID [2022-04-28 08:19:38,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-04-28 08:19:38,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2761#true} {2761#true} #115#return; {2761#true} is VALID [2022-04-28 08:19:38,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {2761#true} call #t~ret10 := main(); {2761#true} is VALID [2022-04-28 08:19:38,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {2761#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {2761#true} is VALID [2022-04-28 08:19:38,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2761#true} is VALID [2022-04-28 08:19:38,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {2761#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2761#true} is VALID [2022-04-28 08:19:38,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !(0 != ~p1~0); {2761#true} is VALID [2022-04-28 08:19:38,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#true} assume !(0 != ~p2~0); {2761#true} is VALID [2022-04-28 08:19:38,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !(0 != ~p3~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:38,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2766#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:38,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2766#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:38,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {2766#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:38,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {2766#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:38,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p3~0; {2762#false} is VALID [2022-04-28 08:19:38,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#false} assume 1 != ~lk3~0; {2762#false} is VALID [2022-04-28 08:19:38,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2022-04-28 08:19:38,221 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:19:38,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:38,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168152269] [2022-04-28 08:19:38,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168152269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:38,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:38,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:38,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:38,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1542576166] [2022-04-28 08:19:38,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1542576166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:38,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:38,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:38,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921642918] [2022-04-28 08:19:38,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:38,223 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:19:38,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:38,223 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:19:38,233 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:19:38,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:38,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:38,234 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:38,318 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-04-28 08:19:38,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:38,319 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:19:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:38,319 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:19:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-28 08:19:38,320 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:19:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-28 08:19:38,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2022-04-28 08:19:38,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:38,386 INFO L225 Difference]: With dead ends: 231 [2022-04-28 08:19:38,386 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 08:19:38,386 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:19:38,387 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:38,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 08:19:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-28 08:19:38,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:38,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,395 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,395 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:38,398 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-28 08:19:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-28 08:19:38,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:38,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:38,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-28 08:19:38,399 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-28 08:19:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:38,401 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-28 08:19:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-28 08:19:38,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:38,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:38,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:38,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-04-28 08:19:38,404 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-04-28 08:19:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:38,405 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-04-28 08:19:38,405 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:19:38,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 199 transitions. [2022-04-28 08:19:38,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-04-28 08:19:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:19:38,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:38,570 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:19:38,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:19:38,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-04-28 08:19:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:38,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537600930] [2022-04-28 08:19:38,571 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 2 times [2022-04-28 08:19:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:38,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163557116] [2022-04-28 08:19:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:38,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:38,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3779#true} is VALID [2022-04-28 08:19:38,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {3779#true} assume true; {3779#true} is VALID [2022-04-28 08:19:38,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3779#true} {3779#true} #115#return; {3779#true} is VALID [2022-04-28 08:19:38,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:38,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3779#true} is VALID [2022-04-28 08:19:38,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {3779#true} assume true; {3779#true} is VALID [2022-04-28 08:19:38,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3779#true} {3779#true} #115#return; {3779#true} is VALID [2022-04-28 08:19:38,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {3779#true} call #t~ret10 := main(); {3779#true} is VALID [2022-04-28 08:19:38,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {3779#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {3779#true} is VALID [2022-04-28 08:19:38,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {3779#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {3779#true} is VALID [2022-04-28 08:19:38,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {3779#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3779#true} is VALID [2022-04-28 08:19:38,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {3779#true} assume !(0 != ~p1~0); {3779#true} is VALID [2022-04-28 08:19:38,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {3779#true} assume !(0 != ~p2~0); {3779#true} is VALID [2022-04-28 08:19:38,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {3779#true} assume 0 != ~p3~0;~lk3~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:38,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {3784#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:38,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {3784#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:38,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:38,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3784#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:38,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3780#false} is VALID [2022-04-28 08:19:38,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {3780#false} assume 0 != ~p4~0; {3780#false} is VALID [2022-04-28 08:19:38,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {3780#false} assume 1 != ~lk4~0; {3780#false} is VALID [2022-04-28 08:19:38,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2022-04-28 08:19:38,615 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:19:38,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:38,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163557116] [2022-04-28 08:19:38,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163557116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:38,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:38,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:38,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:38,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537600930] [2022-04-28 08:19:38,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537600930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:38,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:38,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267201951] [2022-04-28 08:19:38,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:38,616 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:19:38,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:38,616 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:19:38,626 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:19:38,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:38,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:38,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:38,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:38,627 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:38,708 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-04-28 08:19:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:38,709 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:19:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:38,709 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:19:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 08:19:38,712 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:19:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 08:19:38,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 08:19:38,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:38,773 INFO L225 Difference]: With dead ends: 205 [2022-04-28 08:19:38,773 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 08:19:38,775 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:19:38,775 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:38,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 08:19:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-28 08:19:38,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:38,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,789 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,791 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:38,794 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-28 08:19:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-28 08:19:38,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:38,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:38,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states. [2022-04-28 08:19:38,795 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states. [2022-04-28 08:19:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:38,798 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-28 08:19:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-28 08:19:38,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:38,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:38,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:38,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-04-28 08:19:38,801 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-04-28 08:19:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:38,801 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-04-28 08:19:38,801 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:19:38,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 203 transitions. [2022-04-28 08:19:38,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-04-28 08:19:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:19:38,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:38,991 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:19:38,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:19:38,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-04-28 08:19:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:38,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629491585] [2022-04-28 08:19:38,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 2 times [2022-04-28 08:19:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:38,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214803219] [2022-04-28 08:19:38,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:39,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {4775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4769#true} is VALID [2022-04-28 08:19:39,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-28 08:19:39,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4769#true} {4769#true} #115#return; {4769#true} is VALID [2022-04-28 08:19:39,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {4769#true} call ULTIMATE.init(); {4775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:39,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {4775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4769#true} is VALID [2022-04-28 08:19:39,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-28 08:19:39,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4769#true} {4769#true} #115#return; {4769#true} is VALID [2022-04-28 08:19:39,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {4769#true} call #t~ret10 := main(); {4769#true} is VALID [2022-04-28 08:19:39,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {4769#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {4769#true} is VALID [2022-04-28 08:19:39,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {4769#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {4769#true} is VALID [2022-04-28 08:19:39,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {4769#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4769#true} is VALID [2022-04-28 08:19:39,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {4769#true} assume !(0 != ~p1~0); {4769#true} is VALID [2022-04-28 08:19:39,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {4769#true} assume !(0 != ~p2~0); {4769#true} is VALID [2022-04-28 08:19:39,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {4769#true} assume !(0 != ~p3~0); {4769#true} is VALID [2022-04-28 08:19:39,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {4769#true} assume 0 != ~p4~0;~lk4~0 := 1; {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:39,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {4774#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:39,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:39,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:39,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:39,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(= main_~lk4~0 1)} assume 0 != ~p4~0; {4774#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:39,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {4774#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {4770#false} is VALID [2022-04-28 08:19:39,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {4770#false} assume !false; {4770#false} is VALID [2022-04-28 08:19:39,026 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:19:39,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:39,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214803219] [2022-04-28 08:19:39,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214803219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:39,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:39,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:39,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:39,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629491585] [2022-04-28 08:19:39,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629491585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:39,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:39,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:39,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164291727] [2022-04-28 08:19:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:39,028 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:19:39,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:39,028 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:19:39,039 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:19:39,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:39,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:39,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:39,040 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:39,136 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-04-28 08:19:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:39,136 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:19:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:39,136 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:19:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-28 08:19:39,137 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:19:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-28 08:19:39,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-04-28 08:19:39,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:39,186 INFO L225 Difference]: With dead ends: 237 [2022-04-28 08:19:39,186 INFO L226 Difference]: Without dead ends: 235 [2022-04-28 08:19:39,186 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:19:39,186 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:39,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-28 08:19:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-04-28 08:19:39,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:39,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,198 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,198 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:39,202 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-28 08:19:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-28 08:19:39,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:39,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:39,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-28 08:19:39,204 INFO L87 Difference]: Start difference. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-28 08:19:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:39,208 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-28 08:19:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-28 08:19:39,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:39,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:39,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:39,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-04-28 08:19:39,212 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-04-28 08:19:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:39,212 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-04-28 08:19:39,212 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:19:39,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 201 states and 283 transitions. [2022-04-28 08:19:39,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-04-28 08:19:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:19:39,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:39,462 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:19:39,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:19:39,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:39,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:39,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-04-28 08:19:39,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:39,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080753918] [2022-04-28 08:19:39,463 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 2 times [2022-04-28 08:19:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:39,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005666599] [2022-04-28 08:19:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:39,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {6133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6127#true} is VALID [2022-04-28 08:19:39,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {6127#true} assume true; {6127#true} is VALID [2022-04-28 08:19:39,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6127#true} {6127#true} #115#return; {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {6127#true} call ULTIMATE.init(); {6133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:39,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {6133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {6127#true} assume true; {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6127#true} {6127#true} #115#return; {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {6127#true} call #t~ret10 := main(); {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {6127#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {6127#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {6127#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {6127#true} assume !(0 != ~p1~0); {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {6127#true} assume !(0 != ~p2~0); {6127#true} is VALID [2022-04-28 08:19:39,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {6127#true} assume !(0 != ~p3~0); {6127#true} is VALID [2022-04-28 08:19:39,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {6127#true} assume !(0 != ~p4~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:39,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {6132#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6132#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:39,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p1~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:39,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p2~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:39,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p3~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:39,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(= main_~p4~0 0)} assume 0 != ~p4~0; {6128#false} is VALID [2022-04-28 08:19:39,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#false} assume 1 != ~lk4~0; {6128#false} is VALID [2022-04-28 08:19:39,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {6128#false} assume !false; {6128#false} is VALID [2022-04-28 08:19:39,523 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:19:39,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:39,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005666599] [2022-04-28 08:19:39,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005666599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:39,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:39,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:39,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:39,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080753918] [2022-04-28 08:19:39,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080753918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:39,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:39,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140649098] [2022-04-28 08:19:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:39,524 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:19:39,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:39,524 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:19:39,539 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:19:39,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:39,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:39,540 INFO L87 Difference]: Start difference. First operand 201 states and 283 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:39,666 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-04-28 08:19:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:39,666 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:19:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:39,666 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:19:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-28 08:19:39,667 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:19:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-28 08:19:39,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-28 08:19:39,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:39,734 INFO L225 Difference]: With dead ends: 445 [2022-04-28 08:19:39,734 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 08:19:39,737 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:19:39,738 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:39,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 08:19:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-28 08:19:39,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:39,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,753 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,755 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:39,759 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-28 08:19:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-28 08:19:39,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:39,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:39,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-28 08:19:39,760 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-28 08:19:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:39,764 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-28 08:19:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-28 08:19:39,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:39,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:39,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:39,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-04-28 08:19:39,785 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-04-28 08:19:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:39,785 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-04-28 08:19:39,786 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:19:39,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 343 transitions. [2022-04-28 08:19:40,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-04-28 08:19:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:19:40,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:40,094 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:19:40,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:19:40,095 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:40,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-04-28 08:19:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:40,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [153751564] [2022-04-28 08:19:40,095 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 2 times [2022-04-28 08:19:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:40,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584343194] [2022-04-28 08:19:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:40,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:40,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {8067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8061#true} is VALID [2022-04-28 08:19:40,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-28 08:19:40,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8061#true} {8061#true} #115#return; {8061#true} is VALID [2022-04-28 08:19:40,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {8061#true} call ULTIMATE.init(); {8067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:40,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {8067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8061#true} is VALID [2022-04-28 08:19:40,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-28 08:19:40,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8061#true} {8061#true} #115#return; {8061#true} is VALID [2022-04-28 08:19:40,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {8061#true} call #t~ret10 := main(); {8061#true} is VALID [2022-04-28 08:19:40,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {8061#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {8061#true} is VALID [2022-04-28 08:19:40,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {8061#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {8061#true} is VALID [2022-04-28 08:19:40,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {8061#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {8061#true} is VALID [2022-04-28 08:19:40,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {8061#true} assume !(0 != ~p1~0); {8061#true} is VALID [2022-04-28 08:19:40,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {8061#true} assume !(0 != ~p2~0); {8061#true} is VALID [2022-04-28 08:19:40,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {8061#true} assume !(0 != ~p3~0); {8061#true} is VALID [2022-04-28 08:19:40,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {8061#true} assume 0 != ~p4~0;~lk4~0 := 1; {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:40,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {8066#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:40,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:40,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:40,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:40,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {8062#false} is VALID [2022-04-28 08:19:40,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {8062#false} assume 0 != ~p5~0; {8062#false} is VALID [2022-04-28 08:19:40,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {8062#false} assume 1 != ~lk5~0; {8062#false} is VALID [2022-04-28 08:19:40,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {8062#false} assume !false; {8062#false} is VALID [2022-04-28 08:19:40,147 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:19:40,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:40,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584343194] [2022-04-28 08:19:40,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584343194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:40,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:40,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:40,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:40,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [153751564] [2022-04-28 08:19:40,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [153751564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:40,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:40,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:40,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320629446] [2022-04-28 08:19:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:40,148 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:19:40,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:40,148 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:19:40,166 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:19:40,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:40,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:40,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:40,167 INFO L87 Difference]: Start difference. First operand 257 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:40,259 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-04-28 08:19:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:40,260 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:19:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:40,260 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:19:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 08:19:40,261 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:19:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 08:19:40,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-28 08:19:40,320 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:19:40,324 INFO L225 Difference]: With dead ends: 385 [2022-04-28 08:19:40,324 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 08:19:40,324 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:19:40,325 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:40,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 08:19:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-04-28 08:19:40,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:40,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,338 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,338 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:40,344 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-28 08:19:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-28 08:19:40,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:40,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:40,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 08:19:40,345 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 08:19:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:40,348 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-28 08:19:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-28 08:19:40,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:40,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:40,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:40,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-04-28 08:19:40,354 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-04-28 08:19:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:40,354 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-04-28 08:19:40,354 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:19:40,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 343 transitions. [2022-04-28 08:19:40,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-04-28 08:19:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:19:40,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:40,666 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:19:40,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:19:40,667 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-04-28 08:19:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:40,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878546419] [2022-04-28 08:19:40,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 2 times [2022-04-28 08:19:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:40,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242759622] [2022-04-28 08:19:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:40,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:40,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {9913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9907#true} is VALID [2022-04-28 08:19:40,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {9907#true} assume true; {9907#true} is VALID [2022-04-28 08:19:40,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9907#true} {9907#true} #115#return; {9907#true} is VALID [2022-04-28 08:19:40,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {9907#true} call ULTIMATE.init(); {9913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:40,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {9913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9907#true} is VALID [2022-04-28 08:19:40,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {9907#true} assume true; {9907#true} is VALID [2022-04-28 08:19:40,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9907#true} {9907#true} #115#return; {9907#true} is VALID [2022-04-28 08:19:40,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {9907#true} call #t~ret10 := main(); {9907#true} is VALID [2022-04-28 08:19:40,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {9907#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {9907#true} is VALID [2022-04-28 08:19:40,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {9907#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {9907#true} is VALID [2022-04-28 08:19:40,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {9907#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {9907#true} is VALID [2022-04-28 08:19:40,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {9907#true} assume !(0 != ~p1~0); {9907#true} is VALID [2022-04-28 08:19:40,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {9907#true} assume !(0 != ~p2~0); {9907#true} is VALID [2022-04-28 08:19:40,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {9907#true} assume !(0 != ~p3~0); {9907#true} is VALID [2022-04-28 08:19:40,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {9907#true} assume !(0 != ~p4~0); {9907#true} is VALID [2022-04-28 08:19:40,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {9907#true} assume 0 != ~p5~0;~lk5~0 := 1; {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:40,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:40,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:40,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:40,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:40,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {9912#(= main_~lk5~0 1)} assume 0 != ~p5~0; {9912#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:40,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {9912#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {9908#false} is VALID [2022-04-28 08:19:40,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {9908#false} assume !false; {9908#false} is VALID [2022-04-28 08:19:40,696 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:19:40,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:40,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242759622] [2022-04-28 08:19:40,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242759622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:40,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:40,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:40,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:40,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878546419] [2022-04-28 08:19:40,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878546419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:40,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:40,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:40,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323495824] [2022-04-28 08:19:40,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:40,697 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:19:40,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:40,698 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:19:40,707 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:19:40,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:40,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:40,708 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:40,800 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-04-28 08:19:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:40,800 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:19:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:40,800 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:19:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 08:19:40,801 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:19:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 08:19:40,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-28 08:19:40,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:40,840 INFO L225 Difference]: With dead ends: 427 [2022-04-28 08:19:40,840 INFO L226 Difference]: Without dead ends: 425 [2022-04-28 08:19:40,840 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:19:40,840 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:40,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-28 08:19:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-04-28 08:19:40,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:40,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,861 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,862 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:40,869 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-28 08:19:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-28 08:19:40,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:40,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:40,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 425 states. [2022-04-28 08:19:40,871 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 425 states. [2022-04-28 08:19:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:40,878 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-28 08:19:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-28 08:19:40,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:40,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:40,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:40,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-04-28 08:19:40,886 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-04-28 08:19:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:40,887 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-04-28 08:19:40,887 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:19:40,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 495 transitions. [2022-04-28 08:19:41,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-04-28 08:19:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:19:41,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:41,318 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:19:41,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:19:41,318 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-04-28 08:19:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:41,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [84076272] [2022-04-28 08:19:41,319 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 2 times [2022-04-28 08:19:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:41,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688065801] [2022-04-28 08:19:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:41,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12409#true} is VALID [2022-04-28 08:19:41,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {12409#true} assume true; {12409#true} is VALID [2022-04-28 08:19:41,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12409#true} {12409#true} #115#return; {12409#true} is VALID [2022-04-28 08:19:41,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {12409#true} call ULTIMATE.init(); {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:41,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12409#true} is VALID [2022-04-28 08:19:41,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {12409#true} assume true; {12409#true} is VALID [2022-04-28 08:19:41,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12409#true} {12409#true} #115#return; {12409#true} is VALID [2022-04-28 08:19:41,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {12409#true} call #t~ret10 := main(); {12409#true} is VALID [2022-04-28 08:19:41,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {12409#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;havoc ~cond~0; {12409#true} is VALID [2022-04-28 08:19:41,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {12409#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {12409#true} is VALID [2022-04-28 08:19:41,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {12409#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {12409#true} is VALID [2022-04-28 08:19:41,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {12409#true} assume !(0 != ~p1~0); {12409#true} is VALID [2022-04-28 08:19:41,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {12409#true} assume !(0 != ~p2~0); {12409#true} is VALID [2022-04-28 08:19:41,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {12409#true} assume !(0 != ~p3~0); {12409#true} is VALID [2022-04-28 08:19:41,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {12409#true} assume !(0 != ~p4~0); {12409#true} is VALID [2022-04-28 08:19:41,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {12409#true} assume !(0 != ~p5~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:41,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p1~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:41,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p2~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:41,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p3~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:41,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p4~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:41,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {12414#(= main_~p5~0 0)} assume 0 != ~p5~0; {12410#false} is VALID [2022-04-28 08:19:41,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {12410#false} assume 1 != ~lk5~0; {12410#false} is VALID [2022-04-28 08:19:41,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {12410#false} assume !false; {12410#false} is VALID [2022-04-28 08:19:41,360 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:19:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:41,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688065801] [2022-04-28 08:19:41,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688065801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:41,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:41,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:41,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:41,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [84076272] [2022-04-28 08:19:41,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [84076272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:41,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:41,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860652880] [2022-04-28 08:19:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:41,361 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:19:41,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:41,361 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:19:41,372 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:19:41,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:41,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:41,373 INFO L87 Difference]: Start difference. First operand 393 states and 495 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:41,485 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-04-28 08:19:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:41,485 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:19:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:41,485 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:19:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 08:19:41,486 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:19:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-28 08:19:41,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-28 08:19:41,534 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:19:41,534 INFO L225 Difference]: With dead ends: 857 [2022-04-28 08:19:41,535 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 08:19:41,536 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:19:41,536 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:41,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 08:19:41,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 08:19:41,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:41,537 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:19:41,537 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:19:41,537 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:19:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:41,537 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:19:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:19:41,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:41,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:41,537 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:19:41,537 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:19:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:41,538 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:19:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:19:41,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:41,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:41,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:41,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:41,538 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:19:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 08:19:41,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-28 08:19:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:41,538 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 08:19:41,538 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:19:41,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 08:19:41,538 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:19:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:19:41,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:41,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 08:19:41,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:19:41,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 08:19:44,238 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 08:19:44,238 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 08:19:44,238 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 08:19:44,238 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:19:44,238 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:19:44,238 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:19:44,238 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:19:44,238 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 08:19:44,238 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 08:19:44,239 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:19:44,239 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-04-28 08:19:44,239 INFO L902 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-04-28 08:19:44,239 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (not (= main_~p4~0 0))) (.cse1 (= main_~lk4~0 1))) (or (and .cse0 .cse1 (= main_~p5~0 0)) (and (= main_~lk5~0 1) .cse0 .cse1))) [2022-04-28 08:19:44,239 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3 .cse6) (and .cse4 .cse7 .cse3 .cse6) (and .cse4 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse5) (and .cse4 .cse2 .cse7 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse1 .cse7 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse6 .cse5) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse0 .cse6 .cse5) (and .cse1 .cse2 .cse7 .cse3))) [2022-04-28 08:19:44,239 INFO L902 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-04-28 08:19:44,239 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-04-28 08:19:44,239 INFO L895 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-04-28 08:19:44,239 INFO L895 garLoopResultBuilder]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse0 .cse5) (and .cse3 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse3 .cse4 .cse1) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 .cse1))) [2022-04-28 08:19:44,240 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (not (= main_~p1~0 0))) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse9 (= main_~lk3~0 1)) (.cse3 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse8))) [2022-04-28 08:19:44,240 INFO L902 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-04-28 08:19:44,240 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-04-28 08:19:44,240 INFO L895 garLoopResultBuilder]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk4~0 1)) (.cse0 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2022-04-28 08:19:44,240 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk3~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse3) (and .cse1 .cse4 .cse6 .cse3) (and .cse1 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse6 .cse3))) [2022-04-28 08:19:44,240 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-04-28 08:19:44,240 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-04-28 08:19:44,240 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 26 90) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-28 08:19:44,241 INFO L895 garLoopResultBuilder]: At program point L55-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-28 08:19:44,241 INFO L895 garLoopResultBuilder]: At program point L51-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-28 08:19:44,241 INFO L895 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-04-28 08:19:44,241 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-28 08:19:44,241 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4))) [2022-04-28 08:19:44,241 INFO L902 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-04-28 08:19:44,241 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 08:19:44,245 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 08:19:44,246 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 08:19:44,251 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 08:19:44,252 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 08:19:44,274 INFO L163 areAnnotationChecker]: CFG has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 08:19:44,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:19:44 BoogieIcfgContainer [2022-04-28 08:19:44,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 08:19:44,282 INFO L158 Benchmark]: Toolchain (without parser) took 9081.76ms. Allocated memory was 180.4MB in the beginning and 229.6MB in the end (delta: 49.3MB). Free memory was 122.7MB in the beginning and 194.3MB in the end (delta: -71.5MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. [2022-04-28 08:19:44,282 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:19:44,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.16ms. Allocated memory was 180.4MB in the beginning and 229.6MB in the end (delta: 49.3MB). Free memory was 122.6MB in the beginning and 201.2MB in the end (delta: -78.6MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-28 08:19:44,283 INFO L158 Benchmark]: Boogie Preprocessor took 23.60ms. Allocated memory is still 229.6MB. Free memory was 201.2MB in the beginning and 199.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 08:19:44,283 INFO L158 Benchmark]: RCFGBuilder took 271.66ms. Allocated memory is still 229.6MB. Free memory was 199.7MB in the beginning and 187.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 08:19:44,283 INFO L158 Benchmark]: TraceAbstraction took 8586.69ms. Allocated memory is still 229.6MB. Free memory was 186.6MB in the beginning and 194.3MB in the end (delta: -7.7MB). Peak memory consumption was 121.3MB. Max. memory is 8.0GB. [2022-04-28 08:19:44,284 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.09ms. Allocated memory is still 180.4MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.16ms. Allocated memory was 180.4MB in the beginning and 229.6MB in the end (delta: 49.3MB). Free memory was 122.6MB in the beginning and 201.2MB in the end (delta: -78.6MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.60ms. Allocated memory is still 229.6MB. Free memory was 201.2MB in the beginning and 199.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 271.66ms. Allocated memory is still 229.6MB. Free memory was 199.7MB in the beginning and 187.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8586.69ms. Allocated memory is still 229.6MB. Free memory was 186.6MB in the beginning and 194.3MB in the end (delta: -7.7MB). Peak memory consumption was 121.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 628 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 519 NumberOfFragments, 1696 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 08:19:44,324 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...