/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:57:48,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:57:48,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:57:48,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:57:48,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:57:48,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:57:48,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:57:48,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:57:48,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:57:48,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:57:48,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:57:48,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:57:48,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:57:48,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:57:48,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:57:48,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:57:48,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:57:48,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:57:48,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:57:48,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:57:48,352 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:57:48,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:57:48,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:57:48,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:57:48,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:57:48,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:57:48,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:57:48,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:57:48,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:57:48,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:57:48,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:57:48,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:57:48,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:57:48,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:57:48,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:57:48,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:57:48,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:57:48,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:57:48,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:57:48,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:57:48,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:57:48,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:57:48,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:57:48,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:57:48,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:57:48,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:57:48,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:57:48,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:57:48,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:57:48,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:57:48,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:57:48,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:57:48,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:57:48,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:57:48,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:57:48,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:57:48,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:57:48,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:57:48,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:57:48,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:57:48,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:57:48,396 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:57:48,396 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:57:48,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:57:48,396 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:57:48,396 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 14:57:48,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:57:48,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:57:48,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:57:48,616 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:57:48,616 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:57:48,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2022-04-28 14:57:48,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029c84c23/19abce3c71184bf8a198444988c7de7a/FLAGd31421c1a [2022-04-28 14:57:48,991 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:57:48,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-28 14:57:48,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029c84c23/19abce3c71184bf8a198444988c7de7a/FLAGd31421c1a [2022-04-28 14:57:49,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029c84c23/19abce3c71184bf8a198444988c7de7a [2022-04-28 14:57:49,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:57:49,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:57:49,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:57:49,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:57:49,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:57:49,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4b867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49, skipping insertion in model container [2022-04-28 14:57:49,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:57:49,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:57:49,153 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_10.c[3901,3914] [2022-04-28 14:57:49,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:57:49,184 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:57:49,212 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_10.c[3901,3914] [2022-04-28 14:57:49,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:57:49,223 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:57:49,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49 WrapperNode [2022-04-28 14:57:49,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:57:49,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:57:49,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:57:49,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:57:49,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:57:49,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:57:49,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:57:49,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:57:49,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (1/1) ... [2022-04-28 14:57:49,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:57:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:57:49,283 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 14:57:49,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:57:49,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:57:49,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:57:49,326 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:57:49,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:57:49,326 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:57:49,326 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:57:49,326 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:57:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:57:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:57:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:57:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:57:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:57:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:57:49,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:57:49,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:57:49,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:57:49,380 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:57:49,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:57:49,519 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:57:49,525 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:57:49,525 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:57:49,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:57:49 BoogieIcfgContainer [2022-04-28 14:57:49,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:57:49,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:57:49,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:57:49,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:57:49,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:57:49" (1/3) ... [2022-04-28 14:57:49,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd826a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:57:49, skipping insertion in model container [2022-04-28 14:57:49,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:49" (2/3) ... [2022-04-28 14:57:49,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd826a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:57:49, skipping insertion in model container [2022-04-28 14:57:49,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:57:49" (3/3) ... [2022-04-28 14:57:49,551 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2022-04-28 14:57:49,559 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:57:49,559 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:57:49,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:57:49,615 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@1d58559c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15a98f2e [2022-04-28 14:57:49,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:57:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 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 14:57:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 14:57:49,631 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:49,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:49,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 1 times [2022-04-28 14:57:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:49,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1963661224] [2022-04-28 14:57:49,646 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 2 times [2022-04-28 14:57:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:49,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318448279] [2022-04-28 14:57:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:49,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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(16, 2);call #Ultimate.allocInit(12, 3); {48#true} is VALID [2022-04-28 14:57:49,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-28 14:57:49,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-28 14:57:49,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:49,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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(16, 2);call #Ultimate.allocInit(12, 3); {48#true} is VALID [2022-04-28 14:57:49,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-28 14:57:49,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-28 14:57:49,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret15 := main(); {48#true} is VALID [2022-04-28 14:57:49,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {48#true} is VALID [2022-04-28 14:57:49,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {48#true} is VALID [2022-04-28 14:57:49,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {48#true} is VALID [2022-04-28 14:57:49,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#true} assume 0 != ~p1~0;~lk1~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p1~0; {53#(= main_~lk1~0 1)} is VALID [2022-04-28 14:57:49,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {49#false} is VALID [2022-04-28 14:57:49,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} assume !false; {49#false} is VALID [2022-04-28 14:57:49,802 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 14:57:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:49,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318448279] [2022-04-28 14:57:49,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318448279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:49,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:49,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:49,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:49,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1963661224] [2022-04-28 14:57:49,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1963661224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:49,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:49,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984553852] [2022-04-28 14:57:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 14:57:49,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:49,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:49,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:49,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:49,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:49,857 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 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 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:50,166 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-04-28 14:57:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:50,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 14:57:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 14:57:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 14:57:50,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 14:57:50,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:50,326 INFO L225 Difference]: With dead ends: 88 [2022-04-28 14:57:50,326 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 14:57:50,328 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 14:57:50,330 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:50,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:57:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 14:57:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-28 14:57:50,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:50,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,355 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,355 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:50,359 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-28 14:57:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-28 14:57:50,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:50,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:50,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 14:57:50,361 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 14:57:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:50,364 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-28 14:57:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-28 14:57:50,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:50,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:50,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:50,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-28 14:57:50,368 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-28 14:57:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:50,368 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-28 14:57:50,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 90 transitions. [2022-04-28 14:57:50,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-28 14:57:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 14:57:50,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:50,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:50,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:57:50,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 1 times [2022-04-28 14:57:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:50,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401037238] [2022-04-28 14:57:50,450 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 2 times [2022-04-28 14:57:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:50,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191235283] [2022-04-28 14:57:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:50,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(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(16, 2);call #Ultimate.allocInit(12, 3); {484#true} is VALID [2022-04-28 14:57:50,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-28 14:57:50,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-28 14:57:50,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {484#true} call ULTIMATE.init(); {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:50,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(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(16, 2);call #Ultimate.allocInit(12, 3); {484#true} is VALID [2022-04-28 14:57:50,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-28 14:57:50,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-28 14:57:50,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} call #t~ret15 := main(); {484#true} is VALID [2022-04-28 14:57:50,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {484#true} is VALID [2022-04-28 14:57:50,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {484#true} is VALID [2022-04-28 14:57:50,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {484#true} is VALID [2022-04-28 14:57:50,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#true} assume !(0 != ~p1~0); {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(= main_~p1~0 0)} assume !(0 != ~p2~0); {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {489#(= main_~p1~0 0)} assume !(0 != ~p10~0); {489#(= main_~p1~0 0)} is VALID [2022-04-28 14:57:50,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p1~0; {485#false} is VALID [2022-04-28 14:57:50,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#false} assume 1 != ~lk1~0; {485#false} is VALID [2022-04-28 14:57:50,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#false} assume !false; {485#false} is VALID [2022-04-28 14:57:50,517 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 14:57:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:50,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191235283] [2022-04-28 14:57:50,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191235283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:50,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:50,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:50,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:50,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401037238] [2022-04-28 14:57:50,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401037238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:50,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:50,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363243850] [2022-04-28 14:57:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:50,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 14:57:50,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:50,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:50,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:50,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:50,535 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:50,729 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-04-28 14:57:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:50,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 14:57:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-28 14:57:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-28 14:57:50,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-28 14:57:50,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:50,870 INFO L225 Difference]: With dead ends: 118 [2022-04-28 14:57:50,870 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 14:57:50,870 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 14:57:50,871 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:50,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:57:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 14:57:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-28 14:57:50,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:50,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,880 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,880 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:50,883 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-28 14:57:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-28 14:57:50,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:50,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:50,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 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 73 states. [2022-04-28 14:57:50,884 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 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 73 states. [2022-04-28 14:57:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:50,886 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-28 14:57:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-28 14:57:50,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:50,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:50,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:50,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-28 14:57:50,888 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-28 14:57:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:50,889 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-28 14:57:50,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:50,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 126 transitions. [2022-04-28 14:57:50,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-28 14:57:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:57:50,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:50,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:50,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:57:50,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:50,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 1 times [2022-04-28 14:57:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1909202291] [2022-04-28 14:57:50,994 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 2 times [2022-04-28 14:57:50,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:50,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019922919] [2022-04-28 14:57:50,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:51,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {1026#(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(16, 2);call #Ultimate.allocInit(12, 3); {1020#true} is VALID [2022-04-28 14:57:51,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-28 14:57:51,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-28 14:57:51,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {1020#true} call ULTIMATE.init(); {1026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:51,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#(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(16, 2);call #Ultimate.allocInit(12, 3); {1020#true} is VALID [2022-04-28 14:57:51,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-28 14:57:51,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-28 14:57:51,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {1020#true} call #t~ret15 := main(); {1020#true} is VALID [2022-04-28 14:57:51,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {1020#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {1020#true} is VALID [2022-04-28 14:57:51,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {1020#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1020#true} is VALID [2022-04-28 14:57:51,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {1020#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1020#true} is VALID [2022-04-28 14:57:51,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {1020#true} assume 0 != ~p1~0;~lk1~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1025#(not (= main_~p1~0 0))} is VALID [2022-04-28 14:57:51,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1021#false} is VALID [2022-04-28 14:57:51,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {1021#false} assume 0 != ~p2~0; {1021#false} is VALID [2022-04-28 14:57:51,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {1021#false} assume 1 != ~lk2~0; {1021#false} is VALID [2022-04-28 14:57:51,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2022-04-28 14:57:51,066 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 14:57:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:51,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019922919] [2022-04-28 14:57:51,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019922919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:51,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:51,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:51,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:51,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1909202291] [2022-04-28 14:57:51,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1909202291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:51,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:51,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787482258] [2022-04-28 14:57:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 14:57:51,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:51,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:51,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:51,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:51,082 INFO L87 Difference]: Start difference. First operand 71 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:51,251 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-04-28 14:57:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:51,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 14:57:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 14:57:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 14:57:51,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-28 14:57:51,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:51,402 INFO L225 Difference]: With dead ends: 109 [2022-04-28 14:57:51,402 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:57:51,402 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 14:57:51,403 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:51,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:57:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-28 14:57:51,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:51,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,411 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,411 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:51,413 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-28 14:57:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-28 14:57:51,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:51,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:51,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 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 76 states. [2022-04-28 14:57:51,414 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 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 76 states. [2022-04-28 14:57:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:51,417 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-28 14:57:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-28 14:57:51,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:51,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:51,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:51,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-28 14:57:51,419 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-28 14:57:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:51,419 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-28 14:57:51,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 128 transitions. [2022-04-28 14:57:51,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-28 14:57:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:57:51,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:51,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:51,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 14:57:51,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:51,518 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 1 times [2022-04-28 14:57:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:51,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994817652] [2022-04-28 14:57:51,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 2 times [2022-04-28 14:57:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:51,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947864348] [2022-04-28 14:57:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:51,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {1556#(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(16, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-28 14:57:51,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-28 14:57:51,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-28 14:57:51,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:51,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#(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(16, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-28 14:57:51,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-28 14:57:51,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-28 14:57:51,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret15 := main(); {1550#true} is VALID [2022-04-28 14:57:51,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {1550#true} is VALID [2022-04-28 14:57:51,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {1550#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1550#true} is VALID [2022-04-28 14:57:51,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {1550#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1550#true} is VALID [2022-04-28 14:57:51,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#true} assume !(0 != ~p1~0); {1550#true} is VALID [2022-04-28 14:57:51,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#true} assume !(0 != ~p2~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {1555#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-28 14:57:51,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p2~0; {1551#false} is VALID [2022-04-28 14:57:51,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {1551#false} assume 1 != ~lk2~0; {1551#false} is VALID [2022-04-28 14:57:51,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-28 14:57:51,586 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 14:57:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:51,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947864348] [2022-04-28 14:57:51,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947864348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:51,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:51,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:51,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:51,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994817652] [2022-04-28 14:57:51,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994817652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:51,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:51,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640796501] [2022-04-28 14:57:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 14:57:51,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:51,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:51,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:51,600 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:51,750 INFO L93 Difference]: Finished difference Result 202 states and 360 transitions. [2022-04-28 14:57:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:51,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 14:57:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-28 14:57:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-28 14:57:51,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-28 14:57:51,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:51,866 INFO L225 Difference]: With dead ends: 202 [2022-04-28 14:57:51,867 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 14:57:51,867 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 14:57:51,868 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:51,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 79 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 14:57:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-28 14:57:51,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:51,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,878 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,878 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:51,881 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-28 14:57:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-28 14:57:51,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:51,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:51,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 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 14:57:51,882 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 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 14:57:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:51,885 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-28 14:57:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-28 14:57:51,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:51,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:51,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:51,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 237 transitions. [2022-04-28 14:57:51,889 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 237 transitions. Word has length 22 [2022-04-28 14:57:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:51,890 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 237 transitions. [2022-04-28 14:57:51,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:51,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 237 transitions. [2022-04-28 14:57:52,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2022-04-28 14:57:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:57:52,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:52,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:52,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 14:57:52,077 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 1 times [2022-04-28 14:57:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:52,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729703835] [2022-04-28 14:57:52,078 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 2 times [2022-04-28 14:57:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:52,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65720862] [2022-04-28 14:57:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:52,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {2516#(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(16, 2);call #Ultimate.allocInit(12, 3); {2510#true} is VALID [2022-04-28 14:57:52,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-28 14:57:52,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-28 14:57:52,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {2510#true} call ULTIMATE.init(); {2516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:52,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#(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(16, 2);call #Ultimate.allocInit(12, 3); {2510#true} is VALID [2022-04-28 14:57:52,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-28 14:57:52,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-28 14:57:52,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#true} call #t~ret15 := main(); {2510#true} is VALID [2022-04-28 14:57:52,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {2510#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {2510#true} is VALID [2022-04-28 14:57:52,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {2510#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {2510#true} is VALID [2022-04-28 14:57:52,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {2510#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2510#true} is VALID [2022-04-28 14:57:52,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {2510#true} assume !(0 != ~p1~0); {2510#true} is VALID [2022-04-28 14:57:52,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {2510#true} assume 0 != ~p2~0;~lk2~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {2515#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {2515#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2515#(= main_~lk2~0 1)} is VALID [2022-04-28 14:57:52,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {2515#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2511#false} is VALID [2022-04-28 14:57:52,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {2511#false} assume !false; {2511#false} is VALID [2022-04-28 14:57:52,145 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 14:57:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:52,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65720862] [2022-04-28 14:57:52,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65720862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:52,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:52,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:52,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:52,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729703835] [2022-04-28 14:57:52,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729703835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:52,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:52,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173590979] [2022-04-28 14:57:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:52,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 14:57:52,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:52,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:52,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:52,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:52,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:52,164 INFO L87 Difference]: Start difference. First operand 135 states and 237 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:52,305 INFO L93 Difference]: Finished difference Result 175 states and 307 transitions. [2022-04-28 14:57:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:52,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 14:57:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-28 14:57:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-28 14:57:52,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-28 14:57:52,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:52,386 INFO L225 Difference]: With dead ends: 175 [2022-04-28 14:57:52,386 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 14:57:52,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 14:57:52,388 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:52,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 128 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 14:57:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2022-04-28 14:57:52,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:52,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,412 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,412 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:52,418 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-28 14:57:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-28 14:57:52,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:52,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:52,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 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 173 states. [2022-04-28 14:57:52,419 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 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 173 states. [2022-04-28 14:57:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:52,425 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-28 14:57:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-28 14:57:52,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:52,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:52,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:52,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-28 14:57:52,430 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-28 14:57:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:52,435 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-28 14:57:52,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 235 transitions. [2022-04-28 14:57:52,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-28 14:57:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 14:57:52,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:52,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:52,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 14:57:52,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 1 times [2022-04-28 14:57:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:52,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684711958] [2022-04-28 14:57:52,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 2 times [2022-04-28 14:57:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:52,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010857119] [2022-04-28 14:57:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:52,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#(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(16, 2);call #Ultimate.allocInit(12, 3); {3488#true} is VALID [2022-04-28 14:57:52,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-28 14:57:52,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-28 14:57:52,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {3488#true} call ULTIMATE.init(); {3494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:52,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#(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(16, 2);call #Ultimate.allocInit(12, 3); {3488#true} is VALID [2022-04-28 14:57:52,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-28 14:57:52,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-28 14:57:52,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {3488#true} call #t~ret15 := main(); {3488#true} is VALID [2022-04-28 14:57:52,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {3488#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {3488#true} is VALID [2022-04-28 14:57:52,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {3488#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {3488#true} is VALID [2022-04-28 14:57:52,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {3488#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {3488#true} is VALID [2022-04-28 14:57:52,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {3488#true} assume !(0 != ~p1~0); {3488#true} is VALID [2022-04-28 14:57:52,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {3488#true} assume !(0 != ~p2~0); {3488#true} is VALID [2022-04-28 14:57:52,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {3488#true} assume 0 != ~p3~0;~lk3~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3493#(= main_~lk3~0 1)} is VALID [2022-04-28 14:57:52,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {3493#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3489#false} is VALID [2022-04-28 14:57:52,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {3489#false} assume !false; {3489#false} is VALID [2022-04-28 14:57:52,687 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 14:57:52,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:52,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010857119] [2022-04-28 14:57:52,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010857119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:52,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:52,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:52,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:52,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684711958] [2022-04-28 14:57:52,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684711958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:52,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:52,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202075214] [2022-04-28 14:57:52,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 14:57:52,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:52,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:52,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:52,701 INFO L87 Difference]: Start difference. First operand 135 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:52,831 INFO L93 Difference]: Finished difference Result 251 states and 443 transitions. [2022-04-28 14:57:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:52,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 14:57:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 14:57:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 14:57:52,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-28 14:57:52,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:52,917 INFO L225 Difference]: With dead ends: 251 [2022-04-28 14:57:52,917 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 14:57:52,917 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 14:57:52,918 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:52,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 14:57:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2022-04-28 14:57:52,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:52,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,934 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,935 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:52,940 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-28 14:57:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-28 14:57:52,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:52,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:52,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 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 249 states. [2022-04-28 14:57:52,941 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 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 249 states. [2022-04-28 14:57:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:52,946 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-28 14:57:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-28 14:57:52,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:52,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:52,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:52,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 317 transitions. [2022-04-28 14:57:52,952 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 317 transitions. Word has length 23 [2022-04-28 14:57:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:52,952 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 317 transitions. [2022-04-28 14:57:52,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:52,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 317 transitions. [2022-04-28 14:57:53,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 317 transitions. [2022-04-28 14:57:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 14:57:53,198 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:53,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:53,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 14:57:53,198 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 1 times [2022-04-28 14:57:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:53,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1978992304] [2022-04-28 14:57:53,199 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 2 times [2022-04-28 14:57:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:53,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237279871] [2022-04-28 14:57:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:53,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:53,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {4872#(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(16, 2);call #Ultimate.allocInit(12, 3); {4866#true} is VALID [2022-04-28 14:57:53,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-28 14:57:53,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-28 14:57:53,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {4866#true} call ULTIMATE.init(); {4872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:53,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {4872#(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(16, 2);call #Ultimate.allocInit(12, 3); {4866#true} is VALID [2022-04-28 14:57:53,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-28 14:57:53,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-28 14:57:53,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {4866#true} call #t~ret15 := main(); {4866#true} is VALID [2022-04-28 14:57:53,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {4866#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {4866#true} is VALID [2022-04-28 14:57:53,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {4866#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {4866#true} is VALID [2022-04-28 14:57:53,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {4866#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {4866#true} is VALID [2022-04-28 14:57:53,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#true} assume !(0 != ~p1~0); {4866#true} is VALID [2022-04-28 14:57:53,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#true} assume !(0 != ~p2~0); {4866#true} is VALID [2022-04-28 14:57:53,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {4866#true} assume !(0 != ~p3~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p10~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-28 14:57:53,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p3~0; {4867#false} is VALID [2022-04-28 14:57:53,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {4867#false} assume 1 != ~lk3~0; {4867#false} is VALID [2022-04-28 14:57:53,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {4867#false} assume !false; {4867#false} is VALID [2022-04-28 14:57:53,236 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 14:57:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237279871] [2022-04-28 14:57:53,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237279871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:53,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:53,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:53,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1978992304] [2022-04-28 14:57:53,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1978992304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:53,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:53,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:53,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696894919] [2022-04-28 14:57:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 14:57:53,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:53,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:53,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:53,249 INFO L87 Difference]: Start difference. First operand 183 states and 317 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:53,404 INFO L93 Difference]: Finished difference Result 431 states and 755 transitions. [2022-04-28 14:57:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:53,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 14:57:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-28 14:57:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-28 14:57:53,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-28 14:57:53,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:53,514 INFO L225 Difference]: With dead ends: 431 [2022-04-28 14:57:53,515 INFO L226 Difference]: Without dead ends: 257 [2022-04-28 14:57:53,515 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 14:57:53,516 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:53,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-28 14:57:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2022-04-28 14:57:53,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:53,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,531 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,532 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:53,536 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-28 14:57:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-28 14:57:53,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:53,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:53,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-28 14:57:53,537 INFO L87 Difference]: Start difference. First operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-28 14:57:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:53,541 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-28 14:57:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-28 14:57:53,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:53,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:53,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:53,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 439 transitions. [2022-04-28 14:57:53,546 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 439 transitions. Word has length 23 [2022-04-28 14:57:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:53,546 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 439 transitions. [2022-04-28 14:57:53,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 255 states and 439 transitions. [2022-04-28 14:57:53,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 439 transitions. [2022-04-28 14:57:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:57:53,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:53,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:53,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 14:57:53,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 1 times [2022-04-28 14:57:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:53,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840279133] [2022-04-28 14:57:53,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 2 times [2022-04-28 14:57:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:53,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003830513] [2022-04-28 14:57:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:53,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:53,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {6770#(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(16, 2);call #Ultimate.allocInit(12, 3); {6764#true} is VALID [2022-04-28 14:57:53,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-28 14:57:53,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-28 14:57:53,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {6764#true} call ULTIMATE.init(); {6770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:53,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {6770#(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(16, 2);call #Ultimate.allocInit(12, 3); {6764#true} is VALID [2022-04-28 14:57:53,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-28 14:57:53,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-28 14:57:53,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {6764#true} call #t~ret15 := main(); {6764#true} is VALID [2022-04-28 14:57:53,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {6764#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {6764#true} is VALID [2022-04-28 14:57:53,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {6764#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {6764#true} is VALID [2022-04-28 14:57:53,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {6764#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {6764#true} is VALID [2022-04-28 14:57:53,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {6764#true} assume !(0 != ~p1~0); {6764#true} is VALID [2022-04-28 14:57:53,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {6764#true} assume !(0 != ~p2~0); {6764#true} is VALID [2022-04-28 14:57:53,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {6764#true} assume 0 != ~p3~0;~lk3~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {6769#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6769#(not (= main_~p3~0 0))} is VALID [2022-04-28 14:57:53,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6765#false} is VALID [2022-04-28 14:57:53,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {6765#false} assume 0 != ~p4~0; {6765#false} is VALID [2022-04-28 14:57:53,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {6765#false} assume 1 != ~lk4~0; {6765#false} is VALID [2022-04-28 14:57:53,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {6765#false} assume !false; {6765#false} is VALID [2022-04-28 14:57:53,957 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 14:57:53,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:53,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003830513] [2022-04-28 14:57:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003830513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:53,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:53,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:53,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840279133] [2022-04-28 14:57:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840279133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:53,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:53,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100124844] [2022-04-28 14:57:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:53,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 14:57:53,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:53,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:53,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:53,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:53,971 INFO L87 Difference]: Start difference. First operand 255 states and 439 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,111 INFO L93 Difference]: Finished difference Result 385 states and 661 transitions. [2022-04-28 14:57:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:54,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 14:57:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-28 14:57:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-28 14:57:54,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-28 14:57:54,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:54,220 INFO L225 Difference]: With dead ends: 385 [2022-04-28 14:57:54,220 INFO L226 Difference]: Without dead ends: 263 [2022-04-28 14:57:54,221 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 14:57:54,221 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:54,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-28 14:57:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-28 14:57:54,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:54,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,235 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,235 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,245 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-28 14:57:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-28 14:57:54,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:54,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:54,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 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 263 states. [2022-04-28 14:57:54,248 INFO L87 Difference]: Start difference. First operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 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 263 states. [2022-04-28 14:57:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,252 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-28 14:57:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-28 14:57:54,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:54,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:54,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:54,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 443 transitions. [2022-04-28 14:57:54,257 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 443 transitions. Word has length 24 [2022-04-28 14:57:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:54,257 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 443 transitions. [2022-04-28 14:57:54,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 443 transitions. [2022-04-28 14:57:54,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 443 transitions. [2022-04-28 14:57:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:57:54,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:54,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:54,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 14:57:54,594 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 1 times [2022-04-28 14:57:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:54,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044780559] [2022-04-28 14:57:54,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 2 times [2022-04-28 14:57:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:54,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567487800] [2022-04-28 14:57:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:54,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {8600#(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(16, 2);call #Ultimate.allocInit(12, 3); {8594#true} is VALID [2022-04-28 14:57:54,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-28 14:57:54,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-28 14:57:54,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {8594#true} call ULTIMATE.init(); {8600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:54,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {8600#(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(16, 2);call #Ultimate.allocInit(12, 3); {8594#true} is VALID [2022-04-28 14:57:54,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-28 14:57:54,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-28 14:57:54,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {8594#true} call #t~ret15 := main(); {8594#true} is VALID [2022-04-28 14:57:54,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {8594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {8594#true} is VALID [2022-04-28 14:57:54,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {8594#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {8594#true} is VALID [2022-04-28 14:57:54,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {8594#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {8594#true} is VALID [2022-04-28 14:57:54,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#true} assume !(0 != ~p1~0); {8594#true} is VALID [2022-04-28 14:57:54,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#true} assume !(0 != ~p2~0); {8594#true} is VALID [2022-04-28 14:57:54,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#true} assume !(0 != ~p3~0); {8594#true} is VALID [2022-04-28 14:57:54,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {8594#true} assume 0 != ~p4~0;~lk4~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p4~0; {8599#(= main_~lk4~0 1)} is VALID [2022-04-28 14:57:54,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {8599#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {8595#false} is VALID [2022-04-28 14:57:54,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {8595#false} assume !false; {8595#false} is VALID [2022-04-28 14:57:54,630 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 14:57:54,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:54,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567487800] [2022-04-28 14:57:54,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567487800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:54,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:54,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:54,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:54,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044780559] [2022-04-28 14:57:54,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044780559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:54,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:54,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388662288] [2022-04-28 14:57:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 14:57:54,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:54,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:54,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:54,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:54,649 INFO L87 Difference]: Start difference. First operand 261 states and 443 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,795 INFO L93 Difference]: Finished difference Result 477 states and 821 transitions. [2022-04-28 14:57:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 14:57:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-28 14:57:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-28 14:57:54,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-28 14:57:54,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:54,878 INFO L225 Difference]: With dead ends: 477 [2022-04-28 14:57:54,878 INFO L226 Difference]: Without dead ends: 475 [2022-04-28 14:57:54,878 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 14:57:54,878 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:54,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-28 14:57:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-28 14:57:54,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:54,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,897 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,897 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,906 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-28 14:57:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-28 14:57:54,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:54,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:54,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 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 475 states. [2022-04-28 14:57:54,907 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 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 475 states. [2022-04-28 14:57:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:54,916 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-28 14:57:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-28 14:57:54,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:54,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:54,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:54,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2022-04-28 14:57:54,923 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 24 [2022-04-28 14:57:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:54,924 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2022-04-28 14:57:54,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:54,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 603 transitions. [2022-04-28 14:57:55,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2022-04-28 14:57:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:57:55,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:55,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:55,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 14:57:55,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 1 times [2022-04-28 14:57:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:55,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [168390072] [2022-04-28 14:57:55,349 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 2 times [2022-04-28 14:57:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:55,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229326183] [2022-04-28 14:57:55,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:55,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:55,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {11238#(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(16, 2);call #Ultimate.allocInit(12, 3); {11232#true} is VALID [2022-04-28 14:57:55,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-28 14:57:55,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-28 14:57:55,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {11232#true} call ULTIMATE.init(); {11238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:55,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#(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(16, 2);call #Ultimate.allocInit(12, 3); {11232#true} is VALID [2022-04-28 14:57:55,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {11232#true} call #t~ret15 := main(); {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {11232#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {11232#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {11232#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {11232#true} assume !(0 != ~p1~0); {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {11232#true} assume !(0 != ~p2~0); {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {11232#true} assume !(0 != ~p3~0); {11232#true} is VALID [2022-04-28 14:57:55,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {11232#true} assume !(0 != ~p4~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p10~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p1~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p2~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p3~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-28 14:57:55,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p4~0; {11233#false} is VALID [2022-04-28 14:57:55,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {11233#false} assume 1 != ~lk4~0; {11233#false} is VALID [2022-04-28 14:57:55,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {11233#false} assume !false; {11233#false} is VALID [2022-04-28 14:57:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:57:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:55,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229326183] [2022-04-28 14:57:55,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229326183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:55,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:55,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:55,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [168390072] [2022-04-28 14:57:55,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [168390072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:55,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:55,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169185126] [2022-04-28 14:57:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:55,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 14:57:55,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:55,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:55,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:55,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:55,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:55,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:55,400 INFO L87 Difference]: Start difference. First operand 361 states and 603 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,578 INFO L93 Difference]: Finished difference Result 845 states and 1421 transitions. [2022-04-28 14:57:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:55,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 14:57:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-28 14:57:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-28 14:57:55,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-28 14:57:55,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:55,703 INFO L225 Difference]: With dead ends: 845 [2022-04-28 14:57:55,703 INFO L226 Difference]: Without dead ends: 499 [2022-04-28 14:57:55,704 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 14:57:55,704 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:55,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-28 14:57:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-28 14:57:55,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:55,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,746 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,746 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,755 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-28 14:57:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-28 14:57:55,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:55,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:55,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 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 499 states. [2022-04-28 14:57:55,757 INFO L87 Difference]: Start difference. First operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 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 499 states. [2022-04-28 14:57:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:55,767 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-28 14:57:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-28 14:57:55,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:55,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:55,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:55,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 823 transitions. [2022-04-28 14:57:55,779 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 823 transitions. Word has length 24 [2022-04-28 14:57:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:55,779 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 823 transitions. [2022-04-28 14:57:55,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:55,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 497 states and 823 transitions. [2022-04-28 14:57:56,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 823 transitions. [2022-04-28 14:57:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 14:57:56,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:56,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:56,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 14:57:56,484 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 1 times [2022-04-28 14:57:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:56,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047206970] [2022-04-28 14:57:56,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 2 times [2022-04-28 14:57:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:56,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871515675] [2022-04-28 14:57:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:56,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:56,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {14932#(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(16, 2);call #Ultimate.allocInit(12, 3); {14926#true} is VALID [2022-04-28 14:57:56,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-28 14:57:56,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-28 14:57:56,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {14926#true} call ULTIMATE.init(); {14932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:56,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {14932#(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(16, 2);call #Ultimate.allocInit(12, 3); {14926#true} is VALID [2022-04-28 14:57:56,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-28 14:57:56,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-28 14:57:56,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {14926#true} call #t~ret15 := main(); {14926#true} is VALID [2022-04-28 14:57:56,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {14926#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {14926#true} is VALID [2022-04-28 14:57:56,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {14926#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {14926#true} is VALID [2022-04-28 14:57:56,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {14926#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {14926#true} is VALID [2022-04-28 14:57:56,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {14926#true} assume !(0 != ~p1~0); {14926#true} is VALID [2022-04-28 14:57:56,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {14926#true} assume !(0 != ~p2~0); {14926#true} is VALID [2022-04-28 14:57:56,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {14926#true} assume !(0 != ~p3~0); {14926#true} is VALID [2022-04-28 14:57:56,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {14926#true} assume 0 != ~p4~0;~lk4~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {14931#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {14931#(not (= main_~p4~0 0))} is VALID [2022-04-28 14:57:56,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {14927#false} is VALID [2022-04-28 14:57:56,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {14927#false} assume 0 != ~p5~0; {14927#false} is VALID [2022-04-28 14:57:56,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {14927#false} assume 1 != ~lk5~0; {14927#false} is VALID [2022-04-28 14:57:56,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {14927#false} assume !false; {14927#false} is VALID [2022-04-28 14:57:56,558 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 14:57:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871515675] [2022-04-28 14:57:56,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871515675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:56,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:56,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:56,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047206970] [2022-04-28 14:57:56,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047206970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:56,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:56,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661905455] [2022-04-28 14:57:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2022-04-28 14:57:56,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:56,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:56,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:56,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:56,575 INFO L87 Difference]: Start difference. First operand 497 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,781 INFO L93 Difference]: Finished difference Result 745 states and 1229 transitions. [2022-04-28 14:57:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:56,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2022-04-28 14:57:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-28 14:57:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-28 14:57:56,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-28 14:57:56,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:56,925 INFO L225 Difference]: With dead ends: 745 [2022-04-28 14:57:56,925 INFO L226 Difference]: Without dead ends: 507 [2022-04-28 14:57:56,925 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 14:57:56,926 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:56,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-28 14:57:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-28 14:57:56,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:56,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,954 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,955 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,964 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-28 14:57:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-28 14:57:56,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:56,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:56,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 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 507 states. [2022-04-28 14:57:56,966 INFO L87 Difference]: Start difference. First operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 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 507 states. [2022-04-28 14:57:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:56,975 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-28 14:57:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-28 14:57:56,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:56,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:56,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:56,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2022-04-28 14:57:56,987 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 25 [2022-04-28 14:57:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:56,987 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2022-04-28 14:57:56,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:56,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 823 transitions. [2022-04-28 14:57:57,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2022-04-28 14:57:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 14:57:57,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:57,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:57,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 14:57:57,755 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 1 times [2022-04-28 14:57:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:57,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578126730] [2022-04-28 14:57:57,755 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 2 times [2022-04-28 14:57:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:57,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635350462] [2022-04-28 14:57:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:57,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {18458#(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(16, 2);call #Ultimate.allocInit(12, 3); {18452#true} is VALID [2022-04-28 14:57:57,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-28 14:57:57,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-28 14:57:57,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {18452#true} call ULTIMATE.init(); {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:57,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {18458#(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(16, 2);call #Ultimate.allocInit(12, 3); {18452#true} is VALID [2022-04-28 14:57:57,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-28 14:57:57,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-28 14:57:57,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {18452#true} call #t~ret15 := main(); {18452#true} is VALID [2022-04-28 14:57:57,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {18452#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {18452#true} is VALID [2022-04-28 14:57:57,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {18452#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {18452#true} is VALID [2022-04-28 14:57:57,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {18452#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {18452#true} is VALID [2022-04-28 14:57:57,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {18452#true} assume !(0 != ~p1~0); {18452#true} is VALID [2022-04-28 14:57:57,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {18452#true} assume !(0 != ~p2~0); {18452#true} is VALID [2022-04-28 14:57:57,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {18452#true} assume !(0 != ~p3~0); {18452#true} is VALID [2022-04-28 14:57:57,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {18452#true} assume !(0 != ~p4~0); {18452#true} is VALID [2022-04-28 14:57:57,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {18452#true} assume 0 != ~p5~0;~lk5~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p5~0; {18457#(= main_~lk5~0 1)} is VALID [2022-04-28 14:57:57,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {18457#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {18453#false} is VALID [2022-04-28 14:57:57,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {18453#false} assume !false; {18453#false} is VALID [2022-04-28 14:57:57,824 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 14:57:57,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:57,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635350462] [2022-04-28 14:57:57,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635350462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:57,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:57,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:57,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:57,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578126730] [2022-04-28 14:57:57,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578126730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:57,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:57,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131722308] [2022-04-28 14:57:57,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:57,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2022-04-28 14:57:57,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:57,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:57,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:57,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:57,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:57,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:57,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:57,846 INFO L87 Difference]: Start difference. First operand 505 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:58,091 INFO L93 Difference]: Finished difference Result 909 states and 1505 transitions. [2022-04-28 14:57:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:58,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2022-04-28 14:57:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 14:57:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 14:57:58,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 14:57:58,160 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 14:57:58,211 INFO L225 Difference]: With dead ends: 909 [2022-04-28 14:57:58,211 INFO L226 Difference]: Without dead ends: 907 [2022-04-28 14:57:58,212 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 14:57:58,213 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:58,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-28 14:57:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-28 14:57:58,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:57:58,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,252 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,252 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:58,276 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-28 14:57:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-28 14:57:58,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:58,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:58,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 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 907 states. [2022-04-28 14:57:58,280 INFO L87 Difference]: Start difference. First operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 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 907 states. [2022-04-28 14:57:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:58,305 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-28 14:57:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-28 14:57:58,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:57:58,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:57:58,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:57:58,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:57:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1135 transitions. [2022-04-28 14:57:58,327 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1135 transitions. Word has length 25 [2022-04-28 14:57:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:57:58,328 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1135 transitions. [2022-04-28 14:57:58,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:58,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 713 states and 1135 transitions. [2022-04-28 14:57:59,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1135 edges. 1135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1135 transitions. [2022-04-28 14:57:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 14:57:59,417 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:57:59,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:57:59,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 14:57:59,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:57:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:57:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 1 times [2022-04-28 14:57:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:59,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2001059516] [2022-04-28 14:57:59,418 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:57:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 2 times [2022-04-28 14:57:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:57:59,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340069267] [2022-04-28 14:57:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:57:59,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:57:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:57:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:57:59,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {23528#(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(16, 2);call #Ultimate.allocInit(12, 3); {23522#true} is VALID [2022-04-28 14:57:59,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-28 14:57:59,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-28 14:57:59,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {23522#true} call ULTIMATE.init(); {23528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {23528#(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(16, 2);call #Ultimate.allocInit(12, 3); {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {23522#true} call #t~ret15 := main(); {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {23522#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {23522#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {23522#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {23522#true} assume !(0 != ~p1~0); {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {23522#true} assume !(0 != ~p2~0); {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {23522#true} assume !(0 != ~p3~0); {23522#true} is VALID [2022-04-28 14:57:59,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {23522#true} assume !(0 != ~p4~0); {23522#true} is VALID [2022-04-28 14:57:59,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {23522#true} assume !(0 != ~p5~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p10~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p1~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p2~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p3~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p4~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-28 14:57:59,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p5~0; {23523#false} is VALID [2022-04-28 14:57:59,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {23523#false} assume 1 != ~lk5~0; {23523#false} is VALID [2022-04-28 14:57:59,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {23523#false} assume !false; {23523#false} is VALID [2022-04-28 14:57:59,466 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 14:57:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:57:59,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340069267] [2022-04-28 14:57:59,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340069267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:59,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:59,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:59,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:57:59,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2001059516] [2022-04-28 14:57:59,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2001059516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:57:59,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:57:59,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:57:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836743255] [2022-04-28 14:57:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:57:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2022-04-28 14:57:59,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:57:59,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:59,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:57:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:57:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:57:59,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:57:59,484 INFO L87 Difference]: Start difference. First operand 713 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:57:59,804 INFO L93 Difference]: Finished difference Result 1661 states and 2657 transitions. [2022-04-28 14:57:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:57:59,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2022-04-28 14:57:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:57:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-28 14:57:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:57:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-28 14:57:59,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-28 14:57:59,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:57:59,966 INFO L225 Difference]: With dead ends: 1661 [2022-04-28 14:57:59,966 INFO L226 Difference]: Without dead ends: 971 [2022-04-28 14:57:59,967 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 14:57:59,968 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:57:59,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:57:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-28 14:58:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-28 14:58:00,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:00,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,023 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,024 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:00,050 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-28 14:58:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-28 14:58:00,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:00,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:00,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 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 971 states. [2022-04-28 14:58:00,053 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 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 971 states. [2022-04-28 14:58:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:00,079 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-28 14:58:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-28 14:58:00,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:00,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:00,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:00,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1527 transitions. [2022-04-28 14:58:00,118 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1527 transitions. Word has length 25 [2022-04-28 14:58:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:00,118 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1527 transitions. [2022-04-28 14:58:00,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:00,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1527 transitions. [2022-04-28 14:58:01,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1527 edges. 1527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1527 transitions. [2022-04-28 14:58:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:01,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:01,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:01,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 14:58:01,351 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 1 times [2022-04-28 14:58:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:01,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938126762] [2022-04-28 14:58:01,351 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 2 times [2022-04-28 14:58:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:01,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064070781] [2022-04-28 14:58:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:01,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {30742#(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(16, 2);call #Ultimate.allocInit(12, 3); {30736#true} is VALID [2022-04-28 14:58:01,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-28 14:58:01,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-28 14:58:01,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {30736#true} call ULTIMATE.init(); {30742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:01,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {30742#(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(16, 2);call #Ultimate.allocInit(12, 3); {30736#true} is VALID [2022-04-28 14:58:01,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-28 14:58:01,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {30736#true} call #t~ret15 := main(); {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {30736#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {30736#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {30736#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {30736#true} assume !(0 != ~p1~0); {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {30736#true} assume !(0 != ~p2~0); {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {30736#true} assume !(0 != ~p3~0); {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {30736#true} assume !(0 != ~p4~0); {30736#true} is VALID [2022-04-28 14:58:01,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {30736#true} assume 0 != ~p5~0;~lk5~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {30741#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {30741#(not (= main_~p5~0 0))} is VALID [2022-04-28 14:58:01,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {30737#false} is VALID [2022-04-28 14:58:01,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {30737#false} assume 0 != ~p6~0; {30737#false} is VALID [2022-04-28 14:58:01,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {30737#false} assume 1 != ~lk6~0; {30737#false} is VALID [2022-04-28 14:58:01,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {30737#false} assume !false; {30737#false} is VALID [2022-04-28 14:58:01,420 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 14:58:01,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:01,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064070781] [2022-04-28 14:58:01,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064070781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:01,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:01,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:01,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:01,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938126762] [2022-04-28 14:58:01,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938126762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:01,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:01,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:01,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901326300] [2022-04-28 14:58:01,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2022-04-28 14:58:01,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:01,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:01,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:01,433 INFO L87 Difference]: Start difference. First operand 969 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:01,681 INFO L93 Difference]: Finished difference Result 1453 states and 2281 transitions. [2022-04-28 14:58:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:01,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2022-04-28 14:58:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 14:58:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 14:58:01,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-28 14:58:01,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:01,830 INFO L225 Difference]: With dead ends: 1453 [2022-04-28 14:58:01,830 INFO L226 Difference]: Without dead ends: 987 [2022-04-28 14:58:01,831 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 14:58:01,831 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:01,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-28 14:58:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-28 14:58:01,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:01,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,886 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,887 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:01,923 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-28 14:58:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-28 14:58:01,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:01,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:01,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 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 987 states. [2022-04-28 14:58:01,927 INFO L87 Difference]: Start difference. First operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 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 987 states. [2022-04-28 14:58:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:01,952 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-28 14:58:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-28 14:58:01,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:01,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:01,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:01,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1527 transitions. [2022-04-28 14:58:01,991 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1527 transitions. Word has length 26 [2022-04-28 14:58:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:01,991 INFO L495 AbstractCegarLoop]: Abstraction has 985 states and 1527 transitions. [2022-04-28 14:58:01,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:01,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 985 states and 1527 transitions. [2022-04-28 14:58:03,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1527 edges. 1527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1527 transitions. [2022-04-28 14:58:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:03,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:03,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:03,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 14:58:03,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:03,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 1 times [2022-04-28 14:58:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:03,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [624232142] [2022-04-28 14:58:03,403 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 2 times [2022-04-28 14:58:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:03,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180217677] [2022-04-28 14:58:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:03,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:03,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {37604#(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(16, 2);call #Ultimate.allocInit(12, 3); {37598#true} is VALID [2022-04-28 14:58:03,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-28 14:58:03,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-28 14:58:03,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {37598#true} call ULTIMATE.init(); {37604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:03,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {37604#(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(16, 2);call #Ultimate.allocInit(12, 3); {37598#true} is VALID [2022-04-28 14:58:03,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-28 14:58:03,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-28 14:58:03,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {37598#true} call #t~ret15 := main(); {37598#true} is VALID [2022-04-28 14:58:03,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {37598#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {37598#true} is VALID [2022-04-28 14:58:03,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {37598#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {37598#true} is VALID [2022-04-28 14:58:03,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {37598#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {37598#true} is VALID [2022-04-28 14:58:03,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {37598#true} assume !(0 != ~p1~0); {37598#true} is VALID [2022-04-28 14:58:03,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {37598#true} assume !(0 != ~p2~0); {37598#true} is VALID [2022-04-28 14:58:03,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {37598#true} assume !(0 != ~p3~0); {37598#true} is VALID [2022-04-28 14:58:03,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {37598#true} assume !(0 != ~p4~0); {37598#true} is VALID [2022-04-28 14:58:03,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {37598#true} assume !(0 != ~p5~0); {37598#true} is VALID [2022-04-28 14:58:03,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {37598#true} assume 0 != ~p6~0;~lk6~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p6~0; {37603#(= main_~lk6~0 1)} is VALID [2022-04-28 14:58:03,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {37603#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {37599#false} is VALID [2022-04-28 14:58:03,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {37599#false} assume !false; {37599#false} is VALID [2022-04-28 14:58:03,459 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 14:58:03,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:03,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180217677] [2022-04-28 14:58:03,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180217677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:03,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:03,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:03,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:03,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [624232142] [2022-04-28 14:58:03,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [624232142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:03,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:03,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:03,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976609194] [2022-04-28 14:58:03,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:03,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2022-04-28 14:58:03,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:03,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:03,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:03,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:03,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:03,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:03,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:03,479 INFO L87 Difference]: Start difference. First operand 985 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:03,828 INFO L93 Difference]: Finished difference Result 1741 states and 2745 transitions. [2022-04-28 14:58:03,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:03,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2022-04-28 14:58:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 14:58:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 14:58:03,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 14:58:03,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:04,022 INFO L225 Difference]: With dead ends: 1741 [2022-04-28 14:58:04,023 INFO L226 Difference]: Without dead ends: 1739 [2022-04-28 14:58:04,023 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 14:58:04,023 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:04,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-28 14:58:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-28 14:58:04,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:04,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,127 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,128 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:04,204 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-28 14:58:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-28 14:58:04,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:04,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:04,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 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 1739 states. [2022-04-28 14:58:04,208 INFO L87 Difference]: Start difference. First operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 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 1739 states. [2022-04-28 14:58:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:04,287 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-28 14:58:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-28 14:58:04,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:04,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:04,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:04,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2022-04-28 14:58:04,377 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 26 [2022-04-28 14:58:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:04,377 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2022-04-28 14:58:04,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:04,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1417 states and 2135 transitions. [2022-04-28 14:58:06,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2135 edges. 2135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2022-04-28 14:58:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:06,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:06,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:06,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 14:58:06,151 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:06,152 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 1 times [2022-04-28 14:58:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:06,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [645592677] [2022-04-28 14:58:06,156 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 2 times [2022-04-28 14:58:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:06,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133028283] [2022-04-28 14:58:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:06,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:06,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {47410#(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(16, 2);call #Ultimate.allocInit(12, 3); {47404#true} is VALID [2022-04-28 14:58:06,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-28 14:58:06,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {47404#true} call ULTIMATE.init(); {47410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:06,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {47410#(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(16, 2);call #Ultimate.allocInit(12, 3); {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {47404#true} call #t~ret15 := main(); {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {47404#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {47404#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {47404#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {47404#true} assume !(0 != ~p1~0); {47404#true} is VALID [2022-04-28 14:58:06,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {47404#true} assume !(0 != ~p2~0); {47404#true} is VALID [2022-04-28 14:58:06,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {47404#true} assume !(0 != ~p3~0); {47404#true} is VALID [2022-04-28 14:58:06,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {47404#true} assume !(0 != ~p4~0); {47404#true} is VALID [2022-04-28 14:58:06,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {47404#true} assume !(0 != ~p5~0); {47404#true} is VALID [2022-04-28 14:58:06,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {47404#true} assume !(0 != ~p6~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p10~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p1~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p2~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p3~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p4~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p5~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:06,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p6~0; {47405#false} is VALID [2022-04-28 14:58:06,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {47405#false} assume 1 != ~lk6~0; {47405#false} is VALID [2022-04-28 14:58:06,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {47405#false} assume !false; {47405#false} is VALID [2022-04-28 14:58:06,222 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 14:58:06,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:06,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133028283] [2022-04-28 14:58:06,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133028283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:06,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:06,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:06,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:06,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [645592677] [2022-04-28 14:58:06,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [645592677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:06,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:06,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322118031] [2022-04-28 14:58:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:06,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2022-04-28 14:58:06,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:06,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:06,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:06,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:06,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:06,239 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:06,984 INFO L93 Difference]: Finished difference Result 3277 states and 4953 transitions. [2022-04-28 14:58:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2022-04-28 14:58:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-28 14:58:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-28 14:58:06,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-28 14:58:07,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:07,211 INFO L225 Difference]: With dead ends: 3277 [2022-04-28 14:58:07,211 INFO L226 Difference]: Without dead ends: 1899 [2022-04-28 14:58:07,235 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 14:58:07,236 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:07,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-28 14:58:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-28 14:58:07,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:07,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:07,406 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:07,407 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:07,492 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-28 14:58:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-28 14:58:07,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:07,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:07,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 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 1899 states. [2022-04-28 14:58:07,497 INFO L87 Difference]: Start difference. First operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 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 1899 states. [2022-04-28 14:58:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:07,585 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-28 14:58:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-28 14:58:07,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:07,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:07,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:07,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2823 transitions. [2022-04-28 14:58:07,741 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2823 transitions. Word has length 26 [2022-04-28 14:58:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:07,741 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 2823 transitions. [2022-04-28 14:58:07,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:07,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1897 states and 2823 transitions. [2022-04-28 14:58:09,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2823 edges. 2823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2823 transitions. [2022-04-28 14:58:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:09,879 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:09,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:09,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 14:58:09,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 1 times [2022-04-28 14:58:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:09,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [280604694] [2022-04-28 14:58:09,880 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 2 times [2022-04-28 14:58:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:09,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886731889] [2022-04-28 14:58:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:09,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:09,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {61568#(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(16, 2);call #Ultimate.allocInit(12, 3); {61562#true} is VALID [2022-04-28 14:58:09,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-28 14:58:09,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-28 14:58:09,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {61562#true} call ULTIMATE.init(); {61568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:09,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {61568#(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(16, 2);call #Ultimate.allocInit(12, 3); {61562#true} is VALID [2022-04-28 14:58:09,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-28 14:58:09,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-28 14:58:09,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {61562#true} call #t~ret15 := main(); {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {61562#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {61562#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {61562#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {61562#true} assume !(0 != ~p1~0); {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {61562#true} assume !(0 != ~p2~0); {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {61562#true} assume !(0 != ~p3~0); {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {61562#true} assume !(0 != ~p4~0); {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {61562#true} assume !(0 != ~p5~0); {61562#true} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {61562#true} assume 0 != ~p6~0;~lk6~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {61567#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {61567#(not (= main_~p6~0 0))} is VALID [2022-04-28 14:58:09,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {61563#false} is VALID [2022-04-28 14:58:09,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {61563#false} assume 0 != ~p7~0; {61563#false} is VALID [2022-04-28 14:58:09,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {61563#false} assume 1 != ~lk7~0; {61563#false} is VALID [2022-04-28 14:58:09,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {61563#false} assume !false; {61563#false} is VALID [2022-04-28 14:58:09,946 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 14:58:09,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:09,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886731889] [2022-04-28 14:58:09,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886731889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:09,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:09,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:09,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:09,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [280604694] [2022-04-28 14:58:09,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [280604694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:09,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:09,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145842586] [2022-04-28 14:58:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 14:58:09,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:09,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:09,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:09,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:09,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:09,962 INFO L87 Difference]: Start difference. First operand 1897 states and 2823 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:10,501 INFO L93 Difference]: Finished difference Result 2845 states and 4217 transitions. [2022-04-28 14:58:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:10,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 14:58:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 14:58:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 14:58:10,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-28 14:58:10,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:10,715 INFO L225 Difference]: With dead ends: 2845 [2022-04-28 14:58:10,722 INFO L226 Difference]: Without dead ends: 1931 [2022-04-28 14:58:10,723 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 14:58:10,723 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:10,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 98 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-28 14:58:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-28 14:58:10,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:10,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:10,842 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:10,843 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:10,931 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-28 14:58:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-28 14:58:10,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:10,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:10,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 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 1931 states. [2022-04-28 14:58:10,936 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 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 1931 states. [2022-04-28 14:58:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:11,027 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-28 14:58:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-28 14:58:11,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:11,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:11,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:11,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2823 transitions. [2022-04-28 14:58:11,195 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2823 transitions. Word has length 27 [2022-04-28 14:58:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:11,196 INFO L495 AbstractCegarLoop]: Abstraction has 1929 states and 2823 transitions. [2022-04-28 14:58:11,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:11,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 2823 transitions. [2022-04-28 14:58:13,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2823 edges. 2823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2823 transitions. [2022-04-28 14:58:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:13,728 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:13,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:13,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 14:58:13,728 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 1 times [2022-04-28 14:58:13,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:13,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493127882] [2022-04-28 14:58:13,729 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 2 times [2022-04-28 14:58:13,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:13,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95484758] [2022-04-28 14:58:13,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:13,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:13,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:13,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {74990#(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(16, 2);call #Ultimate.allocInit(12, 3); {74984#true} is VALID [2022-04-28 14:58:13,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-28 14:58:13,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-28 14:58:13,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {74984#true} call ULTIMATE.init(); {74990#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:13,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {74990#(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(16, 2);call #Ultimate.allocInit(12, 3); {74984#true} is VALID [2022-04-28 14:58:13,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-28 14:58:13,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-28 14:58:13,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {74984#true} call #t~ret15 := main(); {74984#true} is VALID [2022-04-28 14:58:13,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {74984#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {74984#true} is VALID [2022-04-28 14:58:13,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {74984#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {74984#true} is VALID [2022-04-28 14:58:13,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {74984#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {74984#true} is VALID [2022-04-28 14:58:13,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {74984#true} assume !(0 != ~p1~0); {74984#true} is VALID [2022-04-28 14:58:13,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {74984#true} assume !(0 != ~p2~0); {74984#true} is VALID [2022-04-28 14:58:13,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {74984#true} assume !(0 != ~p3~0); {74984#true} is VALID [2022-04-28 14:58:13,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {74984#true} assume !(0 != ~p4~0); {74984#true} is VALID [2022-04-28 14:58:13,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {74984#true} assume !(0 != ~p5~0); {74984#true} is VALID [2022-04-28 14:58:13,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {74984#true} assume !(0 != ~p6~0); {74984#true} is VALID [2022-04-28 14:58:13,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {74984#true} assume 0 != ~p7~0;~lk7~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p7~0; {74989#(= main_~lk7~0 1)} is VALID [2022-04-28 14:58:13,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {74989#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {74985#false} is VALID [2022-04-28 14:58:13,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {74985#false} assume !false; {74985#false} is VALID [2022-04-28 14:58:13,778 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 14:58:13,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95484758] [2022-04-28 14:58:13,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95484758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:13,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:13,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:13,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493127882] [2022-04-28 14:58:13,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493127882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:13,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:13,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:13,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491518573] [2022-04-28 14:58:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 14:58:13,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:13,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:13,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:13,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:13,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:13,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:13,793 INFO L87 Difference]: Start difference. First operand 1929 states and 2823 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:14,558 INFO L93 Difference]: Finished difference Result 3341 states and 4969 transitions. [2022-04-28 14:58:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 14:58:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 14:58:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 14:58:14,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-28 14:58:14,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:15,098 INFO L225 Difference]: With dead ends: 3341 [2022-04-28 14:58:15,098 INFO L226 Difference]: Without dead ends: 3339 [2022-04-28 14:58:15,099 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 14:58:15,099 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:15,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-28 14:58:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-28 14:58:15,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:15,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:15,301 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:15,303 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:15,591 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-28 14:58:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-28 14:58:15,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:15,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:15,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 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 3339 states. [2022-04-28 14:58:15,599 INFO L87 Difference]: Start difference. First operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 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 3339 states. [2022-04-28 14:58:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:15,903 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-28 14:58:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-28 14:58:15,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:15,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:15,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:15,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4007 transitions. [2022-04-28 14:58:16,226 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4007 transitions. Word has length 27 [2022-04-28 14:58:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:16,226 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 4007 transitions. [2022-04-28 14:58:16,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:16,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2825 states and 4007 transitions. [2022-04-28 14:58:19,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4007 edges. 4007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4007 transitions. [2022-04-28 14:58:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:19,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:19,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:19,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 14:58:19,373 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:19,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 1 times [2022-04-28 14:58:19,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:19,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783092009] [2022-04-28 14:58:19,374 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 2 times [2022-04-28 14:58:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:19,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708105100] [2022-04-28 14:58:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:19,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:19,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:19,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {94012#(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(16, 2);call #Ultimate.allocInit(12, 3); {94006#true} is VALID [2022-04-28 14:58:19,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-28 14:58:19,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {94006#true} call ULTIMATE.init(); {94012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:19,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {94012#(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(16, 2);call #Ultimate.allocInit(12, 3); {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {94006#true} call #t~ret15 := main(); {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {94006#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {94006#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {94006#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {94006#true} assume !(0 != ~p1~0); {94006#true} is VALID [2022-04-28 14:58:19,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {94006#true} assume !(0 != ~p2~0); {94006#true} is VALID [2022-04-28 14:58:19,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {94006#true} assume !(0 != ~p3~0); {94006#true} is VALID [2022-04-28 14:58:19,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {94006#true} assume !(0 != ~p4~0); {94006#true} is VALID [2022-04-28 14:58:19,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {94006#true} assume !(0 != ~p5~0); {94006#true} is VALID [2022-04-28 14:58:19,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {94006#true} assume !(0 != ~p6~0); {94006#true} is VALID [2022-04-28 14:58:19,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {94006#true} assume !(0 != ~p7~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p10~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p1~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p2~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p3~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p4~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p5~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p6~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-28 14:58:19,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p7~0; {94007#false} is VALID [2022-04-28 14:58:19,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {94007#false} assume 1 != ~lk7~0; {94007#false} is VALID [2022-04-28 14:58:19,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {94007#false} assume !false; {94007#false} is VALID [2022-04-28 14:58:19,449 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 14:58:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:19,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708105100] [2022-04-28 14:58:19,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708105100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:19,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:19,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:19,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:19,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783092009] [2022-04-28 14:58:19,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783092009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:19,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:19,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077872745] [2022-04-28 14:58:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 14:58:19,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:19,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:19,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:19,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:19,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:19,463 INFO L87 Difference]: Start difference. First operand 2825 states and 4007 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:21,631 INFO L93 Difference]: Finished difference Result 6477 states and 9193 transitions. [2022-04-28 14:58:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:21,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 14:58:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 14:58:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 14:58:21,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-28 14:58:21,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:22,271 INFO L225 Difference]: With dead ends: 6477 [2022-04-28 14:58:22,271 INFO L226 Difference]: Without dead ends: 3723 [2022-04-28 14:58:22,274 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 14:58:22,275 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:22,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-28 14:58:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-28 14:58:22,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:22,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:22,526 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:22,528 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:22,876 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-28 14:58:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-28 14:58:22,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:22,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:22,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 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 3723 states. [2022-04-28 14:58:22,884 INFO L87 Difference]: Start difference. First operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 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 3723 states. [2022-04-28 14:58:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:23,233 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-28 14:58:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-28 14:58:23,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:23,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:23,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:23,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5191 transitions. [2022-04-28 14:58:23,847 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5191 transitions. Word has length 27 [2022-04-28 14:58:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:23,847 INFO L495 AbstractCegarLoop]: Abstraction has 3721 states and 5191 transitions. [2022-04-28 14:58:23,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:23,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3721 states and 5191 transitions. [2022-04-28 14:58:28,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5191 edges. 5191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5191 transitions. [2022-04-28 14:58:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:28,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:28,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:28,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 14:58:28,819 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 1 times [2022-04-28 14:58:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:28,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [316175071] [2022-04-28 14:58:28,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 2 times [2022-04-28 14:58:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:28,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562911523] [2022-04-28 14:58:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:28,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:28,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:28,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {121866#(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(16, 2);call #Ultimate.allocInit(12, 3); {121860#true} is VALID [2022-04-28 14:58:28,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {121860#true} call ULTIMATE.init(); {121866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:28,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {121866#(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(16, 2);call #Ultimate.allocInit(12, 3); {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {121860#true} call #t~ret15 := main(); {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {121860#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {121860#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {121860#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {121860#true} assume !(0 != ~p1~0); {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {121860#true} assume !(0 != ~p2~0); {121860#true} is VALID [2022-04-28 14:58:28,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {121860#true} assume !(0 != ~p3~0); {121860#true} is VALID [2022-04-28 14:58:28,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {121860#true} assume !(0 != ~p4~0); {121860#true} is VALID [2022-04-28 14:58:28,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {121860#true} assume !(0 != ~p5~0); {121860#true} is VALID [2022-04-28 14:58:28,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {121860#true} assume !(0 != ~p6~0); {121860#true} is VALID [2022-04-28 14:58:28,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {121860#true} assume 0 != ~p7~0;~lk7~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {121865#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {121865#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {121865#(not (= main_~p7~0 0))} is VALID [2022-04-28 14:58:28,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {121861#false} is VALID [2022-04-28 14:58:28,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {121861#false} assume 0 != ~p8~0; {121861#false} is VALID [2022-04-28 14:58:28,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {121861#false} assume 1 != ~lk8~0; {121861#false} is VALID [2022-04-28 14:58:28,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {121861#false} assume !false; {121861#false} is VALID [2022-04-28 14:58:28,861 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 14:58:28,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:28,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562911523] [2022-04-28 14:58:28,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562911523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:28,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:28,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:28,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:28,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [316175071] [2022-04-28 14:58:28,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [316175071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:28,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:28,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204452669] [2022-04-28 14:58:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:28,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 14:58:28,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:28,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:28,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:28,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:28,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:28,876 INFO L87 Difference]: Start difference. First operand 3721 states and 5191 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:30,477 INFO L93 Difference]: Finished difference Result 5581 states and 7753 transitions. [2022-04-28 14:58:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:30,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 14:58:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 14:58:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 14:58:30,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-28 14:58:30,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:31,152 INFO L225 Difference]: With dead ends: 5581 [2022-04-28 14:58:31,153 INFO L226 Difference]: Without dead ends: 3787 [2022-04-28 14:58:31,157 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 14:58:31,161 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:31,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:31,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-28 14:58:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-28 14:58:31,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:31,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:31,439 INFO L74 IsIncluded]: Start isIncluded. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:31,442 INFO L87 Difference]: Start difference. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:31,826 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-28 14:58:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-28 14:58:31,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:31,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:31,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 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 3787 states. [2022-04-28 14:58:31,836 INFO L87 Difference]: Start difference. First operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 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 3787 states. [2022-04-28 14:58:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:32,202 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-28 14:58:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-28 14:58:32,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:32,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:32,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:32,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5191 transitions. [2022-04-28 14:58:32,831 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5191 transitions. Word has length 28 [2022-04-28 14:58:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:32,831 INFO L495 AbstractCegarLoop]: Abstraction has 3785 states and 5191 transitions. [2022-04-28 14:58:32,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:32,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3785 states and 5191 transitions. [2022-04-28 14:58:37,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5191 edges. 5191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5191 transitions. [2022-04-28 14:58:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:37,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:37,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:37,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 14:58:37,863 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:37,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 1 times [2022-04-28 14:58:37,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:37,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678193003] [2022-04-28 14:58:37,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:37,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 2 times [2022-04-28 14:58:37,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:37,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836519423] [2022-04-28 14:58:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:37,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:37,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {148184#(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(16, 2);call #Ultimate.allocInit(12, 3); {148178#true} is VALID [2022-04-28 14:58:37,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-28 14:58:37,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {148178#true} call ULTIMATE.init(); {148184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {148184#(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(16, 2);call #Ultimate.allocInit(12, 3); {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {148178#true} call #t~ret15 := main(); {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {148178#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {148178#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {148178#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {148178#true} assume !(0 != ~p1~0); {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {148178#true} assume !(0 != ~p2~0); {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {148178#true} assume !(0 != ~p3~0); {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {148178#true} assume !(0 != ~p4~0); {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {148178#true} assume !(0 != ~p5~0); {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {148178#true} assume !(0 != ~p6~0); {148178#true} is VALID [2022-04-28 14:58:37,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {148178#true} assume !(0 != ~p7~0); {148178#true} is VALID [2022-04-28 14:58:37,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {148178#true} assume 0 != ~p8~0;~lk8~0 := 1; {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {148183#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {148183#(= main_~lk8~0 1)} assume 0 != ~p8~0; {148183#(= main_~lk8~0 1)} is VALID [2022-04-28 14:58:37,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {148183#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {148179#false} is VALID [2022-04-28 14:58:37,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {148179#false} assume !false; {148179#false} is VALID [2022-04-28 14:58:37,909 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 14:58:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:37,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836519423] [2022-04-28 14:58:37,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836519423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:37,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:37,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:37,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:37,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678193003] [2022-04-28 14:58:37,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678193003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:37,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:37,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032510419] [2022-04-28 14:58:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 14:58:37,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:37,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:37,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:37,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:37,922 INFO L87 Difference]: Start difference. First operand 3785 states and 5191 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:40,233 INFO L93 Difference]: Finished difference Result 6413 states and 8905 transitions. [2022-04-28 14:58:40,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:40,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 14:58:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 14:58:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 14:58:40,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 14:58:40,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:41,969 INFO L225 Difference]: With dead ends: 6413 [2022-04-28 14:58:41,969 INFO L226 Difference]: Without dead ends: 6411 [2022-04-28 14:58:41,970 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 14:58:41,971 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:41,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:58:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-28 14:58:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-28 14:58:42,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:42,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:42,372 INFO L74 IsIncluded]: Start isIncluded. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:42,376 INFO L87 Difference]: Start difference. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:43,436 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-28 14:58:43,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-28 14:58:43,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:43,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:43,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 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 6411 states. [2022-04-28 14:58:43,451 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 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 6411 states. [2022-04-28 14:58:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:44,549 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-28 14:58:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-28 14:58:44,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:44,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:44,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:44,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7495 transitions. [2022-04-28 14:58:45,864 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7495 transitions. Word has length 28 [2022-04-28 14:58:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:45,864 INFO L495 AbstractCegarLoop]: Abstraction has 5641 states and 7495 transitions. [2022-04-28 14:58:45,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:45,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 7495 transitions. [2022-04-28 14:58:52,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7495 transitions. [2022-04-28 14:58:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:52,783 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:52,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:58:52,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 14:58:52,789 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:52,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 1 times [2022-04-28 14:58:52,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:52,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [195486723] [2022-04-28 14:58:52,790 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 2 times [2022-04-28 14:58:52,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:52,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502976581] [2022-04-28 14:58:52,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:52,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:52,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {185126#(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(16, 2);call #Ultimate.allocInit(12, 3); {185120#true} is VALID [2022-04-28 14:58:52,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-28 14:58:52,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {185120#true} call ULTIMATE.init(); {185126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {185126#(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(16, 2);call #Ultimate.allocInit(12, 3); {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {185120#true} call #t~ret15 := main(); {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {185120#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {185120#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {185120#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {185120#true} assume !(0 != ~p1~0); {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {185120#true} assume !(0 != ~p2~0); {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {185120#true} assume !(0 != ~p3~0); {185120#true} is VALID [2022-04-28 14:58:52,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {185120#true} assume !(0 != ~p4~0); {185120#true} is VALID [2022-04-28 14:58:52,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {185120#true} assume !(0 != ~p5~0); {185120#true} is VALID [2022-04-28 14:58:52,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {185120#true} assume !(0 != ~p6~0); {185120#true} is VALID [2022-04-28 14:58:52,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {185120#true} assume !(0 != ~p7~0); {185120#true} is VALID [2022-04-28 14:58:52,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {185120#true} assume !(0 != ~p8~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {185125#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p10~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p1~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p2~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p3~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p4~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p5~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p6~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p7~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-28 14:58:52,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {185125#(= main_~p8~0 0)} assume 0 != ~p8~0; {185121#false} is VALID [2022-04-28 14:58:52,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {185121#false} assume 1 != ~lk8~0; {185121#false} is VALID [2022-04-28 14:58:52,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {185121#false} assume !false; {185121#false} is VALID [2022-04-28 14:58:52,854 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 14:58:52,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:52,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502976581] [2022-04-28 14:58:52,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502976581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:52,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:52,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:52,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:52,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [195486723] [2022-04-28 14:58:52,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [195486723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:52,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:52,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603232303] [2022-04-28 14:58:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 14:58:52,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:52,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:58:52,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:58:52,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:52,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:52,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:52,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:52,874 INFO L87 Difference]: Start difference. First operand 5641 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:00,701 INFO L93 Difference]: Finished difference Result 12813 states and 16969 transitions. [2022-04-28 14:59:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:00,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 14:59:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 14:59:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-28 14:59:00,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-28 14:59:00,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:02,991 INFO L225 Difference]: With dead ends: 12813 [2022-04-28 14:59:02,991 INFO L226 Difference]: Without dead ends: 7307 [2022-04-28 14:59:02,996 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 14:59:02,997 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:59:02,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:59:03,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-28 14:59:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-28 14:59:03,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:03,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:03,513 INFO L74 IsIncluded]: Start isIncluded. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:03,517 INFO L87 Difference]: Start difference. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:04,884 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-28 14:59:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-28 14:59:04,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:04,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:04,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7307 states. [2022-04-28 14:59:04,900 INFO L87 Difference]: Start difference. First operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7307 states. [2022-04-28 14:59:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:06,207 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-28 14:59:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-28 14:59:06,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:06,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:06,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:06,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9479 transitions. [2022-04-28 14:59:08,470 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9479 transitions. Word has length 28 [2022-04-28 14:59:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:08,470 INFO L495 AbstractCegarLoop]: Abstraction has 7305 states and 9479 transitions. [2022-04-28 14:59:08,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:08,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7305 states and 9479 transitions. [2022-04-28 14:59:16,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9479 edges. 9479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9479 transitions. [2022-04-28 14:59:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:59:16,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:16,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:59:16,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 14:59:16,670 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 1 times [2022-04-28 14:59:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:16,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963517786] [2022-04-28 14:59:16,670 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 2 times [2022-04-28 14:59:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:16,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988803150] [2022-04-28 14:59:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:16,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {239988#(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(16, 2);call #Ultimate.allocInit(12, 3); {239982#true} is VALID [2022-04-28 14:59:16,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {239982#true} call ULTIMATE.init(); {239988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:59:16,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {239988#(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(16, 2);call #Ultimate.allocInit(12, 3); {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {239982#true} call #t~ret15 := main(); {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {239982#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {239982#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {239982#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {239982#true} assume !(0 != ~p1~0); {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {239982#true} assume !(0 != ~p2~0); {239982#true} is VALID [2022-04-28 14:59:16,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {239982#true} assume !(0 != ~p3~0); {239982#true} is VALID [2022-04-28 14:59:16,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {239982#true} assume !(0 != ~p4~0); {239982#true} is VALID [2022-04-28 14:59:16,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {239982#true} assume !(0 != ~p5~0); {239982#true} is VALID [2022-04-28 14:59:16,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {239982#true} assume !(0 != ~p6~0); {239982#true} is VALID [2022-04-28 14:59:16,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {239982#true} assume !(0 != ~p7~0); {239982#true} is VALID [2022-04-28 14:59:16,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {239982#true} assume 0 != ~p8~0;~lk8~0 := 1; {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {239987#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {239987#(not (= main_~p8~0 0))} is VALID [2022-04-28 14:59:16,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {239983#false} is VALID [2022-04-28 14:59:16,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {239983#false} assume 0 != ~p9~0; {239983#false} is VALID [2022-04-28 14:59:16,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {239983#false} assume 1 != ~lk9~0; {239983#false} is VALID [2022-04-28 14:59:16,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {239983#false} assume !false; {239983#false} is VALID [2022-04-28 14:59:16,741 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 14:59:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:16,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988803150] [2022-04-28 14:59:16,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988803150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:16,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:16,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:16,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:16,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963517786] [2022-04-28 14:59:16,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963517786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:16,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:16,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86571717] [2022-04-28 14:59:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:16,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 14:59:16,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:16,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:16,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:16,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:16,760 INFO L87 Difference]: Start difference. First operand 7305 states and 9479 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:22,089 INFO L93 Difference]: Finished difference Result 10957 states and 14153 transitions. [2022-04-28 14:59:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:22,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 14:59:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-28 14:59:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-28 14:59:22,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-28 14:59:22,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:24,413 INFO L225 Difference]: With dead ends: 10957 [2022-04-28 14:59:24,413 INFO L226 Difference]: Without dead ends: 7435 [2022-04-28 14:59:24,417 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 14:59:24,418 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:59:24,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:59:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-28 14:59:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-28 14:59:24,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:24,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:24,978 INFO L74 IsIncluded]: Start isIncluded. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:24,984 INFO L87 Difference]: Start difference. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:26,344 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-28 14:59:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-28 14:59:26,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:26,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:26,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7435 states. [2022-04-28 14:59:26,358 INFO L87 Difference]: Start difference. First operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7435 states. [2022-04-28 14:59:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:27,736 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-28 14:59:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-28 14:59:27,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:27,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:27,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:27,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9479 transitions. [2022-04-28 14:59:30,174 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9479 transitions. Word has length 29 [2022-04-28 14:59:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:30,174 INFO L495 AbstractCegarLoop]: Abstraction has 7433 states and 9479 transitions. [2022-04-28 14:59:30,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:30,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7433 states and 9479 transitions. [2022-04-28 14:59:38,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9479 edges. 9479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9479 transitions. [2022-04-28 14:59:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:59:38,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:38,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:59:38,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 14:59:38,553 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 1 times [2022-04-28 14:59:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:38,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539048759] [2022-04-28 14:59:38,554 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 2 times [2022-04-28 14:59:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:38,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75145045] [2022-04-28 14:59:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:38,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:38,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {291650#(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(16, 2);call #Ultimate.allocInit(12, 3); {291644#true} is VALID [2022-04-28 14:59:38,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-28 14:59:38,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {291644#true} call ULTIMATE.init(); {291650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {291650#(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(16, 2);call #Ultimate.allocInit(12, 3); {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {291644#true} call #t~ret15 := main(); {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {291644#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {291644#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {291644#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {291644#true} assume !(0 != ~p1~0); {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {291644#true} assume !(0 != ~p2~0); {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {291644#true} assume !(0 != ~p3~0); {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {291644#true} assume !(0 != ~p4~0); {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {291644#true} assume !(0 != ~p5~0); {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {291644#true} assume !(0 != ~p6~0); {291644#true} is VALID [2022-04-28 14:59:38,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {291644#true} assume !(0 != ~p7~0); {291644#true} is VALID [2022-04-28 14:59:38,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {291644#true} assume !(0 != ~p8~0); {291644#true} is VALID [2022-04-28 14:59:38,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {291644#true} assume 0 != ~p9~0;~lk9~0 := 1; {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {291649#(= main_~lk9~0 1)} assume 0 != ~p9~0; {291649#(= main_~lk9~0 1)} is VALID [2022-04-28 14:59:38,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {291649#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {291645#false} is VALID [2022-04-28 14:59:38,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {291645#false} assume !false; {291645#false} is VALID [2022-04-28 14:59:38,601 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 14:59:38,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:38,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75145045] [2022-04-28 14:59:38,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75145045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:38,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:38,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:38,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:38,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539048759] [2022-04-28 14:59:38,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539048759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:38,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:38,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:38,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310107769] [2022-04-28 14:59:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 14:59:38,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:38,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:38,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:38,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:38,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:38,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:38,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:38,617 INFO L87 Difference]: Start difference. First operand 7433 states and 9479 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:46,317 INFO L93 Difference]: Finished difference Result 12301 states and 15753 transitions. [2022-04-28 14:59:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:46,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 14:59:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 14:59:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 14:59:46,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-28 14:59:46,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:52,741 INFO L225 Difference]: With dead ends: 12301 [2022-04-28 14:59:52,741 INFO L226 Difference]: Without dead ends: 12299 [2022-04-28 14:59:52,743 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 14:59:52,743 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:59:52,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:59:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-28 14:59:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-28 14:59:53,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:53,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:53,618 INFO L74 IsIncluded]: Start isIncluded. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:53,628 INFO L87 Difference]: Start difference. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:59:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:57,767 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-28 14:59:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-28 14:59:57,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:57,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:57,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 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 12299 states. [2022-04-28 14:59:57,800 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 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 12299 states. [2022-04-28 15:00:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:01,956 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-28 15:00:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-28 15:00:01,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:01,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:01,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:01,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13959 transitions. [2022-04-28 15:00:07,277 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13959 transitions. Word has length 29 [2022-04-28 15:00:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:07,277 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 13959 transitions. [2022-04-28 15:00:07,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:07,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 13959 transitions. [2022-04-28 15:00:21,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13959 edges. 13959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13959 transitions. [2022-04-28 15:00:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 15:00:21,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:21,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:00:21,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:00:21,763 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:21,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 1 times [2022-04-28 15:00:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:21,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1685891556] [2022-04-28 15:00:21,764 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 2 times [2022-04-28 15:00:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:21,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796126254] [2022-04-28 15:00:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:21,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {363408#(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(16, 2);call #Ultimate.allocInit(12, 3); {363402#true} is VALID [2022-04-28 15:00:21,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-28 15:00:21,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-28 15:00:21,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {363402#true} call ULTIMATE.init(); {363408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:00:21,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {363408#(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(16, 2);call #Ultimate.allocInit(12, 3); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {363402#true} call #t~ret15 := main(); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {363402#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {363402#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {363402#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {363402#true} assume !(0 != ~p1~0); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {363402#true} assume !(0 != ~p2~0); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {363402#true} assume !(0 != ~p3~0); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {363402#true} assume !(0 != ~p4~0); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {363402#true} assume !(0 != ~p5~0); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {363402#true} assume !(0 != ~p6~0); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {363402#true} assume !(0 != ~p7~0); {363402#true} is VALID [2022-04-28 15:00:21,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {363402#true} assume !(0 != ~p8~0); {363402#true} is VALID [2022-04-28 15:00:21,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {363402#true} assume !(0 != ~p9~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p10~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p1~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p2~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p3~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p4~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p5~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p6~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p7~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p8~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-28 15:00:21,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {363407#(= main_~p9~0 0)} assume 0 != ~p9~0; {363403#false} is VALID [2022-04-28 15:00:21,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {363403#false} assume 1 != ~lk9~0; {363403#false} is VALID [2022-04-28 15:00:21,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {363403#false} assume !false; {363403#false} is VALID [2022-04-28 15:00:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:00:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:21,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796126254] [2022-04-28 15:00:21,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796126254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:21,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:21,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:21,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1685891556] [2022-04-28 15:00:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1685891556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:21,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:21,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376473446] [2022-04-28 15:00:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:21,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 15:00:21,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:21,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:21,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:00:21,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:21,863 INFO L87 Difference]: Start difference. First operand 11273 states and 13959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:54,390 INFO L93 Difference]: Finished difference Result 25357 states and 31113 transitions. [2022-04-28 15:00:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 15:00:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 15:00:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 15:00:54,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-28 15:00:54,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:03,303 INFO L225 Difference]: With dead ends: 25357 [2022-04-28 15:01:03,303 INFO L226 Difference]: Without dead ends: 14347 [2022-04-28 15:01:03,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:03,316 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:03,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-28 15:01:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-28 15:01:04,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:04,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:04,411 INFO L74 IsIncluded]: Start isIncluded. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:04,424 INFO L87 Difference]: Start difference. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:10,071 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-28 15:01:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-28 15:01:10,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:10,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:10,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 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 14347 states. [2022-04-28 15:01:10,107 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 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 14347 states. [2022-04-28 15:01:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:15,500 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-28 15:01:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-28 15:01:15,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:15,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:15,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:15,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 17159 transitions. [2022-04-28 15:01:24,668 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 17159 transitions. Word has length 29 [2022-04-28 15:01:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:24,676 INFO L495 AbstractCegarLoop]: Abstraction has 14345 states and 17159 transitions. [2022-04-28 15:01:24,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:24,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 17159 transitions. [2022-04-28 15:01:42,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 17159 transitions. [2022-04-28 15:01:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:01:42,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:42,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:42,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:01:42,635 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 1 times [2022-04-28 15:01:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [656281597] [2022-04-28 15:01:42,637 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 2 times [2022-04-28 15:01:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:42,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229384529] [2022-04-28 15:01:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:42,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {471518#(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(16, 2);call #Ultimate.allocInit(12, 3); {471512#true} is VALID [2022-04-28 15:01:42,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-28 15:01:42,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-28 15:01:42,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {471512#true} call ULTIMATE.init(); {471518#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:42,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {471518#(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(16, 2);call #Ultimate.allocInit(12, 3); {471512#true} is VALID [2022-04-28 15:01:42,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {471512#true} call #t~ret15 := main(); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {471512#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {471512#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {471512#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {471512#true} assume !(0 != ~p1~0); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {471512#true} assume !(0 != ~p2~0); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {471512#true} assume !(0 != ~p3~0); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {471512#true} assume !(0 != ~p4~0); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {471512#true} assume !(0 != ~p5~0); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {471512#true} assume !(0 != ~p6~0); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {471512#true} assume !(0 != ~p7~0); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {471512#true} assume !(0 != ~p8~0); {471512#true} is VALID [2022-04-28 15:01:42,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {471512#true} assume 0 != ~p9~0;~lk9~0 := 1; {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {471517#(not (= main_~p9~0 0))} is VALID [2022-04-28 15:01:42,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {471513#false} is VALID [2022-04-28 15:01:42,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {471513#false} assume 0 != ~p10~0; {471513#false} is VALID [2022-04-28 15:01:42,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {471513#false} assume 1 != ~lk10~0; {471513#false} is VALID [2022-04-28 15:01:42,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {471513#false} assume !false; {471513#false} is VALID [2022-04-28 15:01:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:42,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229384529] [2022-04-28 15:01:42,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229384529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:42,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:42,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:42,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:42,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [656281597] [2022-04-28 15:01:42,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [656281597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:42,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:42,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:42,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975383778] [2022-04-28 15:01:42,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:42,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 15:01:42,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:42,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:42,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:42,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:42,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:42,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:42,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:42,691 INFO L87 Difference]: Start difference. First operand 14345 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:02,904 INFO L93 Difference]: Finished difference Result 21517 states and 25609 transitions. [2022-04-28 15:02:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 15:02:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 15:02:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 15:02:02,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 15:02:02,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:12,120 INFO L225 Difference]: With dead ends: 21517 [2022-04-28 15:02:12,121 INFO L226 Difference]: Without dead ends: 14603 [2022-04-28 15:02:12,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:02:12,131 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:12,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-28 15:02:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-28 15:02:13,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:13,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:13,253 INFO L74 IsIncluded]: Start isIncluded. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:13,272 INFO L87 Difference]: Start difference. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:18,416 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-28 15:02:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-28 15:02:18,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:18,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:18,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 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 14603 states. [2022-04-28 15:02:18,464 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 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 14603 states. [2022-04-28 15:02:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:23,648 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-28 15:02:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-28 15:02:23,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:23,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:23,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:23,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 17159 transitions. [2022-04-28 15:02:32,866 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 17159 transitions. Word has length 30 [2022-04-28 15:02:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:32,866 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 17159 transitions. [2022-04-28 15:02:32,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:32,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 17159 transitions. [2022-04-28 15:02:49,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17159 edges. 17159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 17159 transitions. [2022-04-28 15:02:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:02:49,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:49,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:02:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:02:49,652 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 1 times [2022-04-28 15:02:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:49,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539732840] [2022-04-28 15:02:49,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 2 times [2022-04-28 15:02:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:49,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795401258] [2022-04-28 15:02:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:49,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {572972#(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(16, 2);call #Ultimate.allocInit(12, 3); {572966#true} is VALID [2022-04-28 15:02:49,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-28 15:02:49,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-28 15:02:49,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {572966#true} call ULTIMATE.init(); {572972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:49,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {572972#(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(16, 2);call #Ultimate.allocInit(12, 3); {572966#true} is VALID [2022-04-28 15:02:49,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-28 15:02:49,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {572966#true} call #t~ret15 := main(); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {572966#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {572966#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {572966#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {572966#true} assume !(0 != ~p1~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {572966#true} assume !(0 != ~p2~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {572966#true} assume !(0 != ~p3~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {572966#true} assume !(0 != ~p4~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {572966#true} assume !(0 != ~p5~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {572966#true} assume !(0 != ~p6~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {572966#true} assume !(0 != ~p7~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {572966#true} assume !(0 != ~p8~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {572966#true} assume !(0 != ~p9~0); {572966#true} is VALID [2022-04-28 15:02:49,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {572966#true} assume !(0 != ~p10~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p1~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p2~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p3~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p4~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p5~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p6~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p7~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p8~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p9~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-28 15:02:49,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {572971#(= main_~p10~0 0)} assume 0 != ~p10~0; {572967#false} is VALID [2022-04-28 15:02:49,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {572967#false} assume 1 != ~lk10~0; {572967#false} is VALID [2022-04-28 15:02:49,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {572967#false} assume !false; {572967#false} is VALID [2022-04-28 15:02:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:02:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:49,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795401258] [2022-04-28 15:02:49,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795401258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:49,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:49,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:49,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:49,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539732840] [2022-04-28 15:02:49,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539732840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:49,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:49,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814289033] [2022-04-28 15:02:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:49,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 15:02:49,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:49,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:49,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:49,694 INFO L87 Difference]: Start difference. First operand 14601 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:05:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:05:53,951 INFO L93 Difference]: Finished difference Result 42251 states and 48392 transitions. [2022-04-28 15:05:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:05:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 15:05:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:05:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:05:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 15:05:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:05:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 15:05:53,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-28 15:05:54,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:06:03,343 INFO L225 Difference]: With dead ends: 42251 [2022-04-28 15:06:03,343 INFO L226 Difference]: Without dead ends: 14601 [2022-04-28 15:06:03,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:06:03,382 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:06:03,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:06:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2022-04-28 15:06:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14601. [2022-04-28 15:06:04,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:06:04,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:04,519 INFO L74 IsIncluded]: Start isIncluded. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:04,537 INFO L87 Difference]: Start difference. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:09,980 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-28 15:06:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-28 15:06:09,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:06:09,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:06:10,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 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 14601 states. [2022-04-28 15:06:10,026 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 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 14601 states. [2022-04-28 15:06:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:15,800 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-28 15:06:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-28 15:06:15,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:06:15,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:06:15,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:06:15,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:06:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16135 transitions. [2022-04-28 15:06:25,068 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16135 transitions. Word has length 30 [2022-04-28 15:06:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:06:25,068 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 16135 transitions. [2022-04-28 15:06:25,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:25,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 16135 transitions. [2022-04-28 15:06:40,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16135 edges. 16135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:06:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-28 15:06:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:06:40,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:06:40,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:06:40,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:06:40,306 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:06:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:06:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 1 times [2022-04-28 15:06:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:06:40,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594417091] [2022-04-28 15:06:40,307 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:06:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 2 times [2022-04-28 15:06:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:06:40,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781627191] [2022-04-28 15:06:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:06:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:06:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:06:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:06:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:06:40,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {715890#(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(16, 2);call #Ultimate.allocInit(12, 3); {715884#true} is VALID [2022-04-28 15:06:40,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-28 15:06:40,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {715884#true} call ULTIMATE.init(); {715890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {715890#(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(16, 2);call #Ultimate.allocInit(12, 3); {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {715884#true} call #t~ret15 := main(); {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {715884#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {715884#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {715884#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {715884#true} assume !(0 != ~p1~0); {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {715884#true} assume !(0 != ~p2~0); {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {715884#true} assume !(0 != ~p3~0); {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {715884#true} assume !(0 != ~p4~0); {715884#true} is VALID [2022-04-28 15:06:40,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {715884#true} assume !(0 != ~p5~0); {715884#true} is VALID [2022-04-28 15:06:40,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {715884#true} assume !(0 != ~p6~0); {715884#true} is VALID [2022-04-28 15:06:40,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {715884#true} assume !(0 != ~p7~0); {715884#true} is VALID [2022-04-28 15:06:40,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {715884#true} assume !(0 != ~p8~0); {715884#true} is VALID [2022-04-28 15:06:40,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {715884#true} assume !(0 != ~p9~0); {715884#true} is VALID [2022-04-28 15:06:40,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {715884#true} assume 0 != ~p10~0;~lk10~0 := 1; {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {715889#(= main_~lk10~0 1)} assume 0 != ~p10~0; {715889#(= main_~lk10~0 1)} is VALID [2022-04-28 15:06:40,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {715889#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {715885#false} is VALID [2022-04-28 15:06:40,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {715885#false} assume !false; {715885#false} is VALID [2022-04-28 15:06:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:06:40,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:06:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781627191] [2022-04-28 15:06:40,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781627191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:06:40,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:06:40,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:06:40,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:06:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594417091] [2022-04-28 15:06:40,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594417091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:06:40,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:06:40,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:06:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754923446] [2022-04-28 15:06:40,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:06:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 15:06:40,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:06:40,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:40,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:06:40,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:06:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:06:40,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:06:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:06:40,375 INFO L87 Difference]: Start difference. First operand 14601 states and 16135 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:50,833 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-28 15:06:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:06:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 15:06:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:06:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-28 15:06:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-28 15:06:50,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-28 15:06:50,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:06:50,874 INFO L225 Difference]: With dead ends: 14601 [2022-04-28 15:06:50,874 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 15:06:50,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:06:50,912 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:06:50,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 62 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:06:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 15:06:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 15:06:50,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:06:50,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:06:50,914 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:06:50,914 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:06:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:50,914 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:06:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:06:50,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:06:50,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:06:50,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 15:06:50,914 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 15:06:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:50,914 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:06:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:06:50,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:06:50,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:06:50,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:06:50,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:06:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:06:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 15:06:50,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-28 15:06:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:06:50,915 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 15:06:50,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:06:50,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 15:06:50,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:06:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:06:50,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:06:50,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:06:50,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:06:50,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 15:07:19,051 WARN L232 SmtUtils]: Spent 28.08s on a formula simplification that was a NOOP. DAG size: 1333 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:08:19,246 WARN L232 SmtUtils]: Spent 1.00m on a formula simplification that was a NOOP. DAG size: 1174 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:10:24,375 WARN L232 SmtUtils]: Spent 2.09m on a formula simplification that was a NOOP. DAG size: 2614 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:10:31,240 WARN L232 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 570 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:11:21,474 WARN L232 SmtUtils]: Spent 50.23s on a formula simplification that was a NOOP. DAG size: 1126 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:11:40,844 WARN L232 SmtUtils]: Spent 19.36s on a formula simplification that was a NOOP. DAG size: 1081 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:12:03,531 WARN L232 SmtUtils]: Spent 22.68s on a formula simplification that was a NOOP. DAG size: 950 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:12:16,579 WARN L232 SmtUtils]: Spent 13.04s on a formula simplification that was a NOOP. DAG size: 1061 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)