/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-34549b5 [2022-04-08 14:54:35,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:54:35,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:54:35,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:54:35,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:54:35,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:54:35,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:54:35,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:54:35,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:54:35,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:54:35,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:54:35,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:54:35,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:54:35,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:54:35,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:54:35,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:54:35,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:54:35,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:54:35,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:54:35,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:54:35,438 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:54:35,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:54:35,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:54:35,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:54:35,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:54:35,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:54:35,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:54:35,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:54:35,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:54:35,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:54:35,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:54:35,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:54:35,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:54:35,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:54:35,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:54:35,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:54:35,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:54:35,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:54:35,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:54:35,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:54:35,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:54:35,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:54:35,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:54:35,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:54:35,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:54:35,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:54:35,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:54:35,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:54:35,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:54:35,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:54:35,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:54:35,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:54:35,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:54:35,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:54:35,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:54:35,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:54:35,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:54:35,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:54:35,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:54:35,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:54:35,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:54:35,463 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:54:35,463 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:54:35,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:54:35,463 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:54:35,463 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:54:35,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:54:35,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:54:35,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:54:35,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:54:35,633 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:54:35,634 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-08 14:54:35,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e32789e5/b9320965bf2d4502ac07ab6cd0713e0f/FLAG0ea9b7ade [2022-04-08 14:54:36,048 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:54:36,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-08 14:54:36,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e32789e5/b9320965bf2d4502ac07ab6cd0713e0f/FLAG0ea9b7ade [2022-04-08 14:54:36,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e32789e5/b9320965bf2d4502ac07ab6cd0713e0f [2022-04-08 14:54:36,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:54:36,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:54:36,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:54:36,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:54:36,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:54:36,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75603a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36, skipping insertion in model container [2022-04-08 14:54:36,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:54:36,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:54:36,222 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-08 14:54:36,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:54:36,239 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:54:36,254 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-08 14:54:36,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:54:36,263 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:54:36,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36 WrapperNode [2022-04-08 14:54:36,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:54:36,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:54:36,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:54:36,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:54:36,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:54:36,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:54:36,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:54:36,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:54:36,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (1/1) ... [2022-04-08 14:54:36,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:54:36,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:54:36,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:54:36,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:54:36,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:54:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:54:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:54:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:54:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:54:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:54:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:54:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:54:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:54:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:54:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:54:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:54:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:54:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:54:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:54:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:54:36,409 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:54:36,410 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:54:36,598 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:54:36,608 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:54:36,608 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:54:36,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:54:36 BoogieIcfgContainer [2022-04-08 14:54:36,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:54:36,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:54:36,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:54:36,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:54:36,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:54:36" (1/3) ... [2022-04-08 14:54:36,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776414f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:54:36, skipping insertion in model container [2022-04-08 14:54:36,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:36" (2/3) ... [2022-04-08 14:54:36,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776414f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:54:36, skipping insertion in model container [2022-04-08 14:54:36,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:54:36" (3/3) ... [2022-04-08 14:54:36,616 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2022-04-08 14:54:36,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:54:36,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:54:36,646 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:54:36,651 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:54:36,651 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:54:36,663 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-08 14:54:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:54:36,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:36,669 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:36,669 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 1 times [2022-04-08 14:54:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:36,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1062218989] [2022-04-08 14:54:36,685 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 2 times [2022-04-08 14:54:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:36,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606544120] [2022-04-08 14:54:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:36,925 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-08 14:54:36,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-08 14:54:36,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-08 14:54:36,927 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-08 14:54:36,927 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-08 14:54:36,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-08 14:54:36,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-08 14:54:36,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret15 := main(); {48#true} is VALID [2022-04-08 14:54:36,928 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-08 14:54:36,928 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-08 14:54:36,929 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-08 14:54:36,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#true} assume 0 != ~p1~0;~lk1~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-08 14:54:36,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-08 14:54:36,932 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-08 14:54:36,932 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-08 14:54:36,933 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-08 14:54:36,933 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-08 14:54:36,934 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-08 14:54:36,935 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-08 14:54:36,936 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-08 14:54:36,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-08 14:54:36,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p1~0; {53#(= main_~lk1~0 1)} is VALID [2022-04-08 14:54:36,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {49#false} is VALID [2022-04-08 14:54:36,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} assume !false; {49#false} is VALID [2022-04-08 14:54:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:36,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606544120] [2022-04-08 14:54:36,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606544120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:36,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:36,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:36,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:36,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1062218989] [2022-04-08 14:54:36,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1062218989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:36,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:36,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:36,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256759494] [2022-04-08 14:54:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:54:36,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:36,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:36,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:36,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:36,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:37,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:37,015 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-08 14:54:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:37,277 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-04-08 14:54:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:37,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:54:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 14:54:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 14:54:37,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 14:54:37,477 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-08 14:54:37,484 INFO L225 Difference]: With dead ends: 88 [2022-04-08 14:54:37,485 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 14:54:37,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:37,489 INFO L913 BasicCegarLoop]: 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-08 14:54:37,489 INFO L914 BasicCegarLoop]: 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-08 14:54:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 14:54:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-08 14:54:37,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:37,514 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-08 14:54:37,514 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-08 14:54:37,515 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-08 14:54:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:37,533 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-08 14:54:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-08 14:54:37,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:37,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:37,535 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-08 14:54:37,535 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-08 14:54:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:37,539 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-08 14:54:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-08 14:54:37,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:37,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:37,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:37,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:37,540 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-08 14:54:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-08 14:54:37,543 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-08 14:54:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:37,543 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-08 14:54:37,544 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:37,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 90 transitions. [2022-04-08 14:54:37,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-08 14:54:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:54:37,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:37,614 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:37,614 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:54:37,615 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:37,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:37,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 1 times [2022-04-08 14:54:37,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:37,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1098681846] [2022-04-08 14:54:37,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 2 times [2022-04-08 14:54:37,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:37,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307858905] [2022-04-08 14:54:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:37,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:37,668 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-08 14:54:37,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-08 14:54:37,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-08 14:54:37,669 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-08 14:54:37,669 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-08 14:54:37,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-08 14:54:37,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-08 14:54:37,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} call #t~ret15 := main(); {484#true} is VALID [2022-04-08 14:54:37,669 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-08 14:54:37,670 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-08 14:54:37,670 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-08 14:54:37,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#true} assume !(0 != ~p1~0); {489#(= main_~p1~0 0)} is VALID [2022-04-08 14:54:37,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(= main_~p1~0 0)} assume !(0 != ~p2~0); {489#(= main_~p1~0 0)} is VALID [2022-04-08 14:54:37,671 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-08 14:54:37,671 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-08 14:54:37,672 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-08 14:54:37,672 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-08 14:54:37,673 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-08 14:54:37,673 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-08 14:54:37,673 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-08 14:54:37,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {489#(= main_~p1~0 0)} assume !(0 != ~p10~0); {489#(= main_~p1~0 0)} is VALID [2022-04-08 14:54:37,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p1~0; {485#false} is VALID [2022-04-08 14:54:37,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#false} assume 1 != ~lk1~0; {485#false} is VALID [2022-04-08 14:54:37,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#false} assume !false; {485#false} is VALID [2022-04-08 14:54:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:37,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307858905] [2022-04-08 14:54:37,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307858905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:37,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:37,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:37,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:37,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1098681846] [2022-04-08 14:54:37,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1098681846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:37,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:37,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:37,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004802902] [2022-04-08 14:54:37,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:37,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:54:37,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:37,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:37,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:37,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:37,693 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-08 14:54:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:37,894 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-04-08 14:54:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:37,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 14:54:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-08 14:54:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-08 14:54:37,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-08 14:54:38,042 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-08 14:54:38,044 INFO L225 Difference]: With dead ends: 118 [2022-04-08 14:54:38,045 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 14:54:38,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:38,046 INFO L913 BasicCegarLoop]: 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-08 14:54:38,046 INFO L914 BasicCegarLoop]: 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-08 14:54:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 14:54:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-08 14:54:38,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:38,058 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-08 14:54:38,060 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-08 14:54:38,060 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-08 14:54:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:38,065 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-08 14:54:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-08 14:54:38,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:38,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:38,067 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-08 14:54:38,068 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-08 14:54:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:38,070 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-08 14:54:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-08 14:54:38,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:38,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:38,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:38,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:38,071 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-08 14:54:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-08 14:54:38,073 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-08 14:54:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:38,073 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-08 14:54:38,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 126 transitions. [2022-04-08 14:54:38,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-08 14:54:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:54:38,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:38,157 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:38,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:54:38,157 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 1 times [2022-04-08 14:54:38,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:38,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [983980129] [2022-04-08 14:54:38,162 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 2 times [2022-04-08 14:54:38,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:38,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937803614] [2022-04-08 14:54:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:38,221 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-08 14:54:38,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-08 14:54:38,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-08 14:54:38,223 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-08 14:54:38,223 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-08 14:54:38,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-08 14:54:38,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-08 14:54:38,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1020#true} call #t~ret15 := main(); {1020#true} is VALID [2022-04-08 14:54:38,224 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-08 14:54:38,224 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-08 14:54:38,224 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-08 14:54:38,226 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-08 14:54:38,227 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-08 14:54:38,227 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-08 14:54:38,228 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-08 14:54:38,228 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-08 14:54:38,228 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-08 14:54:38,228 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-08 14:54:38,229 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-08 14:54:38,229 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-08 14:54:38,229 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-08 14:54:38,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1021#false} is VALID [2022-04-08 14:54:38,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {1021#false} assume 0 != ~p2~0; {1021#false} is VALID [2022-04-08 14:54:38,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {1021#false} assume 1 != ~lk2~0; {1021#false} is VALID [2022-04-08 14:54:38,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2022-04-08 14:54:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:38,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937803614] [2022-04-08 14:54:38,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937803614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:38,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:38,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:38,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:38,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [983980129] [2022-04-08 14:54:38,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [983980129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:38,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:38,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189505015] [2022-04-08 14:54:38,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:54:38,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:38,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:38,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:38,246 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-08 14:54:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:38,401 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-04-08 14:54:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:54:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 14:54:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 14:54:38,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-08 14:54:38,534 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-08 14:54:38,535 INFO L225 Difference]: With dead ends: 109 [2022-04-08 14:54:38,535 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:54:38,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:38,536 INFO L913 BasicCegarLoop]: 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-08 14:54:38,537 INFO L914 BasicCegarLoop]: 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-08 14:54:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:54:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-08 14:54:38,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:38,543 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-08 14:54:38,543 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-08 14:54:38,544 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-08 14:54:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:38,545 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-08 14:54:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-08 14:54:38,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:38,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:38,546 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-08 14:54:38,546 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-08 14:54:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:38,548 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-08 14:54:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-08 14:54:38,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:38,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:38,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:38,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:38,549 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-08 14:54:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-08 14:54:38,551 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-08 14:54:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:38,551 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-08 14:54:38,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 128 transitions. [2022-04-08 14:54:38,641 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-08 14:54:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-08 14:54:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:54:38,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:38,641 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:38,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:54:38,642 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 1 times [2022-04-08 14:54:38,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:38,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [341104102] [2022-04-08 14:54:38,642 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 2 times [2022-04-08 14:54:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:38,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574245894] [2022-04-08 14:54:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:38,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:38,681 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-08 14:54:38,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-08 14:54:38,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-08 14:54:38,682 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-08 14:54:38,682 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-08 14:54:38,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-08 14:54:38,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-08 14:54:38,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret15 := main(); {1550#true} is VALID [2022-04-08 14:54:38,682 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-08 14:54:38,682 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-08 14:54:38,682 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-08 14:54:38,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#true} assume !(0 != ~p1~0); {1550#true} is VALID [2022-04-08 14:54:38,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#true} assume !(0 != ~p2~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-08 14:54:38,683 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-08 14:54:38,683 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-08 14:54:38,684 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-08 14:54:38,684 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-08 14:54:38,684 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-08 14:54:38,685 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-08 14:54:38,685 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-08 14:54:38,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-08 14:54:38,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1555#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-08 14:54:38,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p2~0; {1551#false} is VALID [2022-04-08 14:54:38,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {1551#false} assume 1 != ~lk2~0; {1551#false} is VALID [2022-04-08 14:54:38,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-08 14:54:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:38,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574245894] [2022-04-08 14:54:38,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574245894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:38,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:38,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:38,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:38,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [341104102] [2022-04-08 14:54:38,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [341104102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:38,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:38,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360990258] [2022-04-08 14:54:38,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:38,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:54:38,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:38,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:38,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:38,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:38,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:38,700 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-08 14:54:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:38,837 INFO L93 Difference]: Finished difference Result 202 states and 360 transitions. [2022-04-08 14:54:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:38,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:54:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-08 14:54:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-08 14:54:38,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-08 14:54:38,967 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-08 14:54:38,970 INFO L225 Difference]: With dead ends: 202 [2022-04-08 14:54:38,970 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 14:54:38,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:38,971 INFO L913 BasicCegarLoop]: 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-08 14:54:38,971 INFO L914 BasicCegarLoop]: 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-08 14:54:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 14:54:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-08 14:54:38,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:38,982 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-08 14:54:38,982 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-08 14:54:38,982 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-08 14:54:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:38,985 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-08 14:54:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-08 14:54:38,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:38,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:38,986 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-08 14:54:38,986 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-08 14:54:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:38,989 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-08 14:54:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-08 14:54:38,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:38,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:38,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:38,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:38,990 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-08 14:54:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 237 transitions. [2022-04-08 14:54:38,993 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 237 transitions. Word has length 22 [2022-04-08 14:54:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:38,994 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 237 transitions. [2022-04-08 14:54:38,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:38,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 237 transitions. [2022-04-08 14:54:39,161 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-08 14:54:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2022-04-08 14:54:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:54:39,162 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:39,162 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:39,162 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:54:39,162 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 1 times [2022-04-08 14:54:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:39,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [18277693] [2022-04-08 14:54:39,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 2 times [2022-04-08 14:54:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:39,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333757618] [2022-04-08 14:54:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:39,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:39,200 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-08 14:54:39,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-08 14:54:39,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-08 14:54:39,201 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-08 14:54:39,201 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-08 14:54:39,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-08 14:54:39,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-08 14:54:39,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#true} call #t~ret15 := main(); {2510#true} is VALID [2022-04-08 14:54:39,201 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-08 14:54:39,202 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-08 14:54:39,214 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-08 14:54:39,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {2510#true} assume !(0 != ~p1~0); {2510#true} is VALID [2022-04-08 14:54:39,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {2510#true} assume 0 != ~p2~0;~lk2~0 := 1; {2515#(= main_~lk2~0 1)} is VALID [2022-04-08 14:54:39,215 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-08 14:54:39,215 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-08 14:54:39,216 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-08 14:54:39,216 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-08 14:54:39,217 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-08 14:54:39,217 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-08 14:54:39,218 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-08 14:54:39,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {2515#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2515#(= main_~lk2~0 1)} is VALID [2022-04-08 14:54:39,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {2515#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2515#(= main_~lk2~0 1)} is VALID [2022-04-08 14:54:39,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {2515#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2515#(= main_~lk2~0 1)} is VALID [2022-04-08 14:54:39,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2515#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2511#false} is VALID [2022-04-08 14:54:39,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {2511#false} assume !false; {2511#false} is VALID [2022-04-08 14:54:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:39,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333757618] [2022-04-08 14:54:39,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333757618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:39,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:39,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:39,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:39,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [18277693] [2022-04-08 14:54:39,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [18277693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:39,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:39,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915860529] [2022-04-08 14:54:39,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:54:39,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:39,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:39,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:39,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:39,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:39,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:39,233 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-08 14:54:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:39,398 INFO L93 Difference]: Finished difference Result 175 states and 307 transitions. [2022-04-08 14:54:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:39,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:54:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-08 14:54:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-08 14:54:39,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-08 14:54:39,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:39,478 INFO L225 Difference]: With dead ends: 175 [2022-04-08 14:54:39,478 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 14:54:39,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:39,479 INFO L913 BasicCegarLoop]: 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-08 14:54:39,479 INFO L914 BasicCegarLoop]: 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-08 14:54:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 14:54:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2022-04-08 14:54:39,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:39,490 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-08 14:54:39,490 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-08 14:54:39,490 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-08 14:54:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:39,494 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-08 14:54:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-08 14:54:39,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:39,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:39,495 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-08 14:54:39,495 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-08 14:54:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:39,499 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-08 14:54:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-08 14:54:39,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:39,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:39,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:39,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:39,500 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-08 14:54:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-08 14:54:39,502 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-08 14:54:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:39,503 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-08 14:54:39,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:39,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 235 transitions. [2022-04-08 14:54:39,695 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-08 14:54:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-08 14:54:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:54:39,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:39,696 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:39,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:54:39,696 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 1 times [2022-04-08 14:54:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:39,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012320669] [2022-04-08 14:54:39,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 2 times [2022-04-08 14:54:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:39,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053512885] [2022-04-08 14:54:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:39,730 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-08 14:54:39,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-08 14:54:39,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-08 14:54:39,730 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-08 14:54:39,730 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-08 14:54:39,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-08 14:54:39,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-08 14:54:39,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {3488#true} call #t~ret15 := main(); {3488#true} is VALID [2022-04-08 14:54:39,731 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-08 14:54:39,731 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-08 14:54:39,731 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-08 14:54:39,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {3488#true} assume !(0 != ~p1~0); {3488#true} is VALID [2022-04-08 14:54:39,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {3488#true} assume !(0 != ~p2~0); {3488#true} is VALID [2022-04-08 14:54:39,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {3488#true} assume 0 != ~p3~0;~lk3~0 := 1; {3493#(= main_~lk3~0 1)} is VALID [2022-04-08 14:54:39,732 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-08 14:54:39,732 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-08 14:54:39,732 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-08 14:54:39,733 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-08 14:54:39,733 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-08 14:54:39,733 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-08 14:54:39,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-08 14:54:39,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-08 14:54:39,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {3493#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3493#(= main_~lk3~0 1)} is VALID [2022-04-08 14:54:39,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {3493#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3493#(= main_~lk3~0 1)} is VALID [2022-04-08 14:54:39,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {3493#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3489#false} is VALID [2022-04-08 14:54:39,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {3489#false} assume !false; {3489#false} is VALID [2022-04-08 14:54:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:39,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:39,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053512885] [2022-04-08 14:54:39,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053512885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:39,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:39,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:39,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:39,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012320669] [2022-04-08 14:54:39,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012320669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:39,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:39,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065420448] [2022-04-08 14:54:39,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:54:39,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:39,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:39,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:39,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:39,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:39,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:39,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:39,749 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-08 14:54:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:39,887 INFO L93 Difference]: Finished difference Result 251 states and 443 transitions. [2022-04-08 14:54:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:39,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:54:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 14:54:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 14:54:39,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 14:54:39,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:39,985 INFO L225 Difference]: With dead ends: 251 [2022-04-08 14:54:39,985 INFO L226 Difference]: Without dead ends: 249 [2022-04-08 14:54:39,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:39,986 INFO L913 BasicCegarLoop]: 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-08 14:54:39,986 INFO L914 BasicCegarLoop]: 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-08 14:54:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-08 14:54:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2022-04-08 14:54:39,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:39,997 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-08 14:54:39,997 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-08 14:54:39,998 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-08 14:54:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:40,007 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-08 14:54:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-08 14:54:40,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:40,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:40,008 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-08 14:54:40,009 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-08 14:54:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:40,019 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-08 14:54:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-08 14:54:40,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:40,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:40,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:40,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:40,020 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-08 14:54:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 317 transitions. [2022-04-08 14:54:40,027 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 317 transitions. Word has length 23 [2022-04-08 14:54:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:40,027 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 317 transitions. [2022-04-08 14:54:40,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:40,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 317 transitions. [2022-04-08 14:54:40,286 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-08 14:54:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 317 transitions. [2022-04-08 14:54:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:54:40,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:40,287 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:40,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:54:40,287 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:40,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 1 times [2022-04-08 14:54:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:40,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [640093887] [2022-04-08 14:54:40,287 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 2 times [2022-04-08 14:54:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:40,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176767195] [2022-04-08 14:54:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:40,322 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-08 14:54:40,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-08 14:54:40,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-08 14:54:40,322 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-08 14:54:40,322 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-08 14:54:40,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-08 14:54:40,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-08 14:54:40,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {4866#true} call #t~ret15 := main(); {4866#true} is VALID [2022-04-08 14:54:40,323 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-08 14:54:40,323 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-08 14:54:40,323 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-08 14:54:40,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#true} assume !(0 != ~p1~0); {4866#true} is VALID [2022-04-08 14:54:40,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#true} assume !(0 != ~p2~0); {4866#true} is VALID [2022-04-08 14:54:40,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {4866#true} assume !(0 != ~p3~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-08 14:54:40,324 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-08 14:54:40,324 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-08 14:54:40,324 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-08 14:54:40,324 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-08 14:54:40,325 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-08 14:54:40,325 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-08 14:54:40,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p10~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-08 14:54:40,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-08 14:54:40,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {4871#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-08 14:54:40,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p3~0; {4867#false} is VALID [2022-04-08 14:54:40,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {4867#false} assume 1 != ~lk3~0; {4867#false} is VALID [2022-04-08 14:54:40,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {4867#false} assume !false; {4867#false} is VALID [2022-04-08 14:54:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:40,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:40,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176767195] [2022-04-08 14:54:40,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176767195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:40,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:40,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:40,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:40,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [640093887] [2022-04-08 14:54:40,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [640093887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:40,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:40,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167542532] [2022-04-08 14:54:40,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:40,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:54:40,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:40,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:40,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:40,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:40,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:40,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:40,340 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-08 14:54:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:40,485 INFO L93 Difference]: Finished difference Result 431 states and 755 transitions. [2022-04-08 14:54:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:40,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:54:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-08 14:54:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-08 14:54:40,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-08 14:54:40,593 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-08 14:54:40,597 INFO L225 Difference]: With dead ends: 431 [2022-04-08 14:54:40,597 INFO L226 Difference]: Without dead ends: 257 [2022-04-08 14:54:40,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:40,598 INFO L913 BasicCegarLoop]: 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-08 14:54:40,598 INFO L914 BasicCegarLoop]: 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-08 14:54:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-08 14:54:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2022-04-08 14:54:40,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:40,617 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-08 14:54:40,618 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-08 14:54:40,619 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-08 14:54:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:40,623 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-08 14:54:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-08 14:54:40,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:40,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:40,624 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-08 14:54:40,624 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-08 14:54:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:40,628 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-08 14:54:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-08 14:54:40,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:40,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:40,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:40,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:40,629 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-08 14:54:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 439 transitions. [2022-04-08 14:54:40,634 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 439 transitions. Word has length 23 [2022-04-08 14:54:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:40,634 INFO L478 AbstractCegarLoop]: Abstraction has 255 states and 439 transitions. [2022-04-08 14:54:40,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:40,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 255 states and 439 transitions. [2022-04-08 14:54:41,011 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-08 14:54:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 439 transitions. [2022-04-08 14:54:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:54:41,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:41,012 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:41,012 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 14:54:41,012 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:41,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 1 times [2022-04-08 14:54:41,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:41,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [475806886] [2022-04-08 14:54:41,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:41,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 2 times [2022-04-08 14:54:41,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:41,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759291495] [2022-04-08 14:54:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:41,050 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-08 14:54:41,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-08 14:54:41,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-08 14:54:41,050 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-08 14:54:41,050 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-08 14:54:41,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-08 14:54:41,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-08 14:54:41,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {6764#true} call #t~ret15 := main(); {6764#true} is VALID [2022-04-08 14:54:41,051 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-08 14:54:41,051 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-08 14:54:41,051 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-08 14:54:41,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {6764#true} assume !(0 != ~p1~0); {6764#true} is VALID [2022-04-08 14:54:41,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {6764#true} assume !(0 != ~p2~0); {6764#true} is VALID [2022-04-08 14:54:41,051 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-08 14:54:41,051 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-08 14:54:41,052 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-08 14:54:41,052 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-08 14:54:41,052 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-08 14:54:41,053 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-08 14:54:41,053 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-08 14:54:41,053 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-08 14:54:41,053 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-08 14:54:41,054 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-08 14:54:41,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6765#false} is VALID [2022-04-08 14:54:41,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {6765#false} assume 0 != ~p4~0; {6765#false} is VALID [2022-04-08 14:54:41,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {6765#false} assume 1 != ~lk4~0; {6765#false} is VALID [2022-04-08 14:54:41,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {6765#false} assume !false; {6765#false} is VALID [2022-04-08 14:54:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:41,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759291495] [2022-04-08 14:54:41,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759291495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:41,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:41,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:41,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:41,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [475806886] [2022-04-08 14:54:41,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [475806886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:41,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:41,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742457264] [2022-04-08 14:54:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:54:41,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:41,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:41,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:41,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:41,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:41,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:41,068 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-08 14:54:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:41,208 INFO L93 Difference]: Finished difference Result 385 states and 661 transitions. [2022-04-08 14:54:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:41,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:54:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-08 14:54:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-08 14:54:41,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-08 14:54:41,312 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-08 14:54:41,316 INFO L225 Difference]: With dead ends: 385 [2022-04-08 14:54:41,316 INFO L226 Difference]: Without dead ends: 263 [2022-04-08 14:54:41,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:41,317 INFO L913 BasicCegarLoop]: 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-08 14:54:41,317 INFO L914 BasicCegarLoop]: 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-08 14:54:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-08 14:54:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-08 14:54:41,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:41,338 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-08 14:54:41,339 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-08 14:54:41,340 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-08 14:54:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:41,345 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-08 14:54:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-08 14:54:41,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:41,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:41,346 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-08 14:54:41,346 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-08 14:54:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:41,350 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-08 14:54:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-08 14:54:41,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:41,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:41,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:41,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:41,351 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-08 14:54:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 443 transitions. [2022-04-08 14:54:41,356 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 443 transitions. Word has length 24 [2022-04-08 14:54:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:41,356 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 443 transitions. [2022-04-08 14:54:41,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:41,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 443 transitions. [2022-04-08 14:54:41,742 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-08 14:54:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 443 transitions. [2022-04-08 14:54:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:54:41,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:41,742 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:41,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 14:54:41,743 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 1 times [2022-04-08 14:54:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:41,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819268699] [2022-04-08 14:54:41,743 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 2 times [2022-04-08 14:54:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:41,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713197227] [2022-04-08 14:54:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:41,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:41,805 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-08 14:54:41,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-08 14:54:41,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-08 14:54:41,806 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-08 14:54:41,806 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-08 14:54:41,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-08 14:54:41,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-08 14:54:41,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {8594#true} call #t~ret15 := main(); {8594#true} is VALID [2022-04-08 14:54:41,806 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-08 14:54:41,806 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-08 14:54:41,806 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-08 14:54:41,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#true} assume !(0 != ~p1~0); {8594#true} is VALID [2022-04-08 14:54:41,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#true} assume !(0 != ~p2~0); {8594#true} is VALID [2022-04-08 14:54:41,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#true} assume !(0 != ~p3~0); {8594#true} is VALID [2022-04-08 14:54:41,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {8594#true} assume 0 != ~p4~0;~lk4~0 := 1; {8599#(= main_~lk4~0 1)} is VALID [2022-04-08 14:54:41,808 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-08 14:54:41,808 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-08 14:54:41,808 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-08 14:54:41,808 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-08 14:54:41,809 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-08 14:54:41,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-08 14:54:41,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-08 14:54:41,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-08 14:54:41,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {8599#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {8599#(= main_~lk4~0 1)} is VALID [2022-04-08 14:54:41,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {8599#(= main_~lk4~0 1)} assume 0 != ~p4~0; {8599#(= main_~lk4~0 1)} is VALID [2022-04-08 14:54:41,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {8599#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {8595#false} is VALID [2022-04-08 14:54:41,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {8595#false} assume !false; {8595#false} is VALID [2022-04-08 14:54:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:41,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713197227] [2022-04-08 14:54:41,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713197227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:41,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:41,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:41,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:41,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819268699] [2022-04-08 14:54:41,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819268699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:41,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:41,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435554634] [2022-04-08 14:54:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:54:41,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:41,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:41,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:41,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:41,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:41,823 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-08 14:54:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:41,960 INFO L93 Difference]: Finished difference Result 477 states and 821 transitions. [2022-04-08 14:54:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:41,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:54:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 14:54:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 14:54:41,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-08 14:54:42,031 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-08 14:54:42,042 INFO L225 Difference]: With dead ends: 477 [2022-04-08 14:54:42,042 INFO L226 Difference]: Without dead ends: 475 [2022-04-08 14:54:42,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:42,042 INFO L913 BasicCegarLoop]: 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-08 14:54:42,043 INFO L914 BasicCegarLoop]: 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-08 14:54:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-08 14:54:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-08 14:54:42,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:42,061 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-08 14:54:42,062 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-08 14:54:42,062 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-08 14:54:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:42,071 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-08 14:54:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-08 14:54:42,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:42,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:42,073 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-08 14:54:42,073 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-08 14:54:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:42,102 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-08 14:54:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-08 14:54:42,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:42,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:42,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:42,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:42,103 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-08 14:54:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2022-04-08 14:54:42,110 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 24 [2022-04-08 14:54:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:42,110 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2022-04-08 14:54:42,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:42,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 603 transitions. [2022-04-08 14:54:42,594 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-08 14:54:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2022-04-08 14:54:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:54:42,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:42,596 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:42,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 14:54:42,596 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 1 times [2022-04-08 14:54:42,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:42,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155444926] [2022-04-08 14:54:42,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:42,597 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 2 times [2022-04-08 14:54:42,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:42,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182482878] [2022-04-08 14:54:42,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:42,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:42,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:42,649 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-08 14:54:42,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-08 14:54:42,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-08 14:54:42,650 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-08 14:54:42,650 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-08 14:54:42,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-08 14:54:42,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-08 14:54:42,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {11232#true} call #t~ret15 := main(); {11232#true} is VALID [2022-04-08 14:54:42,650 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-08 14:54:42,650 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-08 14:54:42,650 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-08 14:54:42,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {11232#true} assume !(0 != ~p1~0); {11232#true} is VALID [2022-04-08 14:54:42,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {11232#true} assume !(0 != ~p2~0); {11232#true} is VALID [2022-04-08 14:54:42,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {11232#true} assume !(0 != ~p3~0); {11232#true} is VALID [2022-04-08 14:54:42,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {11232#true} assume !(0 != ~p4~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-08 14:54:42,651 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-08 14:54:42,651 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-08 14:54:42,652 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-08 14:54:42,652 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-08 14:54:42,652 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-08 14:54:42,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p10~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-08 14:54:42,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p1~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-08 14:54:42,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p2~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-08 14:54:42,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {11237#(= main_~p4~0 0)} assume !(0 != ~p3~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-08 14:54:42,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p4~0; {11233#false} is VALID [2022-04-08 14:54:42,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {11233#false} assume 1 != ~lk4~0; {11233#false} is VALID [2022-04-08 14:54:42,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {11233#false} assume !false; {11233#false} is VALID [2022-04-08 14:54:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:42,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:42,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182482878] [2022-04-08 14:54:42,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182482878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:42,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:42,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:42,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:42,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155444926] [2022-04-08 14:54:42,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155444926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:42,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:42,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:42,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020970309] [2022-04-08 14:54:42,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:42,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:54:42,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:42,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:42,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:42,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:42,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:42,667 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-08 14:54:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:42,863 INFO L93 Difference]: Finished difference Result 845 states and 1421 transitions. [2022-04-08 14:54:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:54:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 14:54:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 14:54:42,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-08 14:54:42,969 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-08 14:54:42,980 INFO L225 Difference]: With dead ends: 845 [2022-04-08 14:54:42,980 INFO L226 Difference]: Without dead ends: 499 [2022-04-08 14:54:42,981 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:42,981 INFO L913 BasicCegarLoop]: 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-08 14:54:42,981 INFO L914 BasicCegarLoop]: 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-08 14:54:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-08 14:54:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-08 14:54:43,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:43,008 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-08 14:54:43,008 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-08 14:54:43,009 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-08 14:54:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:43,018 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-08 14:54:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-08 14:54:43,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:43,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:43,020 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-08 14:54:43,021 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-08 14:54:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:43,031 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-08 14:54:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-08 14:54:43,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:43,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:43,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:43,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:43,032 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-08 14:54:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 823 transitions. [2022-04-08 14:54:43,044 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 823 transitions. Word has length 24 [2022-04-08 14:54:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:43,044 INFO L478 AbstractCegarLoop]: Abstraction has 497 states and 823 transitions. [2022-04-08 14:54:43,044 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:54:43,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 497 states and 823 transitions. [2022-04-08 14:54:43,745 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-08 14:54:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 823 transitions. [2022-04-08 14:54:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:54:43,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:43,746 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:43,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 14:54:43,747 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:43,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 1 times [2022-04-08 14:54:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:43,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856839853] [2022-04-08 14:54:43,747 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 2 times [2022-04-08 14:54:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:43,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010503103] [2022-04-08 14:54:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:43,801 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-08 14:54:43,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-08 14:54:43,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-08 14:54:43,801 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-08 14:54:43,801 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-08 14:54:43,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-08 14:54:43,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-08 14:54:43,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {14926#true} call #t~ret15 := main(); {14926#true} is VALID [2022-04-08 14:54:43,802 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-08 14:54:43,802 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-08 14:54:43,802 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-08 14:54:43,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {14926#true} assume !(0 != ~p1~0); {14926#true} is VALID [2022-04-08 14:54:43,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {14926#true} assume !(0 != ~p2~0); {14926#true} is VALID [2022-04-08 14:54:43,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {14926#true} assume !(0 != ~p3~0); {14926#true} is VALID [2022-04-08 14:54:43,802 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-08 14:54:43,803 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-08 14:54:43,803 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-08 14:54:43,819 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-08 14:54:43,819 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-08 14:54:43,819 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-08 14:54:43,820 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-08 14:54:43,820 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-08 14:54:43,820 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-08 14:54:43,820 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-08 14:54:43,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {14927#false} is VALID [2022-04-08 14:54:43,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {14927#false} assume 0 != ~p5~0; {14927#false} is VALID [2022-04-08 14:54:43,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {14927#false} assume 1 != ~lk5~0; {14927#false} is VALID [2022-04-08 14:54:43,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {14927#false} assume !false; {14927#false} is VALID [2022-04-08 14:54:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:43,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:43,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010503103] [2022-04-08 14:54:43,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010503103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:43,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:43,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:43,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:43,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856839853] [2022-04-08 14:54:43,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856839853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:43,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:43,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154932305] [2022-04-08 14:54:43,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:43,822 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-08 14:54:43,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:43,822 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-08 14:54:43,835 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-08 14:54:43,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:43,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:43,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:43,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:43,836 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-08 14:54:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:44,017 INFO L93 Difference]: Finished difference Result 745 states and 1229 transitions. [2022-04-08 14:54:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:44,018 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-08 14:54:44,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:44,018 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-08 14:54:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-08 14:54:44,019 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-08 14:54:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-08 14:54:44,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-08 14:54:44,120 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-08 14:54:44,131 INFO L225 Difference]: With dead ends: 745 [2022-04-08 14:54:44,132 INFO L226 Difference]: Without dead ends: 507 [2022-04-08 14:54:44,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:44,133 INFO L913 BasicCegarLoop]: 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-08 14:54:44,133 INFO L914 BasicCegarLoop]: 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-08 14:54:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-08 14:54:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-08 14:54:44,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:44,167 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-08 14:54:44,168 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-08 14:54:44,168 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-08 14:54:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:44,178 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-08 14:54:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-08 14:54:44,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:44,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:44,180 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-08 14:54:44,180 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-08 14:54:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:44,191 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-08 14:54:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-08 14:54:44,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:44,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:44,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:44,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:44,192 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-08 14:54:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2022-04-08 14:54:44,204 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 25 [2022-04-08 14:54:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:44,204 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2022-04-08 14:54:44,204 INFO L479 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-08 14:54:44,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 823 transitions. [2022-04-08 14:54:44,919 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-08 14:54:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2022-04-08 14:54:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:54:44,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:44,920 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:44,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 14:54:44,920 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:44,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 1 times [2022-04-08 14:54:44,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:44,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435501595] [2022-04-08 14:54:44,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:44,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 2 times [2022-04-08 14:54:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:44,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985060648] [2022-04-08 14:54:44,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:44,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:44,956 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-08 14:54:44,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-08 14:54:44,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-08 14:54:44,956 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-08 14:54:44,957 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-08 14:54:44,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-08 14:54:44,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-08 14:54:44,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {18452#true} call #t~ret15 := main(); {18452#true} is VALID [2022-04-08 14:54:44,957 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-08 14:54:44,957 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-08 14:54:44,957 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-08 14:54:44,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {18452#true} assume !(0 != ~p1~0); {18452#true} is VALID [2022-04-08 14:54:44,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {18452#true} assume !(0 != ~p2~0); {18452#true} is VALID [2022-04-08 14:54:44,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {18452#true} assume !(0 != ~p3~0); {18452#true} is VALID [2022-04-08 14:54:44,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {18452#true} assume !(0 != ~p4~0); {18452#true} is VALID [2022-04-08 14:54:44,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {18452#true} assume 0 != ~p5~0;~lk5~0 := 1; {18457#(= main_~lk5~0 1)} is VALID [2022-04-08 14:54:44,958 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-08 14:54:44,958 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-08 14:54:44,958 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-08 14:54:44,959 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-08 14:54:44,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-08 14:54:44,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-08 14:54:44,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-08 14:54:44,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-08 14:54:44,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {18457#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {18457#(= main_~lk5~0 1)} is VALID [2022-04-08 14:54:44,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {18457#(= main_~lk5~0 1)} assume 0 != ~p5~0; {18457#(= main_~lk5~0 1)} is VALID [2022-04-08 14:54:44,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {18457#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {18453#false} is VALID [2022-04-08 14:54:44,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {18453#false} assume !false; {18453#false} is VALID [2022-04-08 14:54:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:44,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985060648] [2022-04-08 14:54:44,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985060648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:44,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:44,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:44,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:44,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435501595] [2022-04-08 14:54:44,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435501595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:44,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:44,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:44,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977485078] [2022-04-08 14:54:44,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:44,962 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-08 14:54:44,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:44,962 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-08 14:54:44,974 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-08 14:54:44,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:44,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:44,975 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-08 14:54:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:45,159 INFO L93 Difference]: Finished difference Result 909 states and 1505 transitions. [2022-04-08 14:54:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:45,160 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-08 14:54:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:45,160 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-08 14:54:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:54:45,161 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-08 14:54:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:54:45,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 14:54:45,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:54:45,272 INFO L225 Difference]: With dead ends: 909 [2022-04-08 14:54:45,272 INFO L226 Difference]: Without dead ends: 907 [2022-04-08 14:54:45,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:45,273 INFO L913 BasicCegarLoop]: 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-08 14:54:45,273 INFO L914 BasicCegarLoop]: 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-08 14:54:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-08 14:54:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-08 14:54:45,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:45,312 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-08 14:54:45,313 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-08 14:54:45,314 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-08 14:54:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:45,340 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-08 14:54:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-08 14:54:45,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:45,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:45,343 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-08 14:54:45,343 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-08 14:54:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:45,369 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-08 14:54:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-08 14:54:45,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:45,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:45,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:45,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:45,371 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-08 14:54:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1135 transitions. [2022-04-08 14:54:45,392 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1135 transitions. Word has length 25 [2022-04-08 14:54:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:45,393 INFO L478 AbstractCegarLoop]: Abstraction has 713 states and 1135 transitions. [2022-04-08 14:54:45,393 INFO L479 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-08 14:54:45,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 713 states and 1135 transitions. [2022-04-08 14:54:46,381 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-08 14:54:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1135 transitions. [2022-04-08 14:54:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:54:46,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:46,382 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:46,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 14:54:46,382 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 1 times [2022-04-08 14:54:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:46,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [119774664] [2022-04-08 14:54:46,383 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 2 times [2022-04-08 14:54:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:46,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46574552] [2022-04-08 14:54:46,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:46,413 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-08 14:54:46,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-08 14:54:46,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-08 14:54:46,413 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-08 14:54:46,414 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-08 14:54:46,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-08 14:54:46,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-08 14:54:46,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {23522#true} call #t~ret15 := main(); {23522#true} is VALID [2022-04-08 14:54:46,414 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-08 14:54:46,414 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-08 14:54:46,414 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-08 14:54:46,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {23522#true} assume !(0 != ~p1~0); {23522#true} is VALID [2022-04-08 14:54:46,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {23522#true} assume !(0 != ~p2~0); {23522#true} is VALID [2022-04-08 14:54:46,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {23522#true} assume !(0 != ~p3~0); {23522#true} is VALID [2022-04-08 14:54:46,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {23522#true} assume !(0 != ~p4~0); {23522#true} is VALID [2022-04-08 14:54:46,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {23522#true} assume !(0 != ~p5~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-08 14:54:46,415 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-08 14:54:46,415 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-08 14:54:46,415 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-08 14:54:46,416 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-08 14:54:46,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p10~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-08 14:54:46,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p1~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-08 14:54:46,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p2~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-08 14:54:46,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p3~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-08 14:54:46,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {23527#(= main_~p5~0 0)} assume !(0 != ~p4~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-08 14:54:46,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p5~0; {23523#false} is VALID [2022-04-08 14:54:46,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {23523#false} assume 1 != ~lk5~0; {23523#false} is VALID [2022-04-08 14:54:46,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {23523#false} assume !false; {23523#false} is VALID [2022-04-08 14:54:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:46,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:46,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46574552] [2022-04-08 14:54:46,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46574552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:46,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:46,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:46,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:46,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [119774664] [2022-04-08 14:54:46,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [119774664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:46,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:46,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18224394] [2022-04-08 14:54:46,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:46,420 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-08 14:54:46,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:46,421 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-08 14:54:46,433 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-08 14:54:46,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:46,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:46,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:46,434 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-08 14:54:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:46,749 INFO L93 Difference]: Finished difference Result 1661 states and 2657 transitions. [2022-04-08 14:54:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:46,749 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-08 14:54:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:46,750 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-08 14:54:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-08 14:54:46,751 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-08 14:54:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-08 14:54:46,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-08 14:54:46,862 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-08 14:54:46,900 INFO L225 Difference]: With dead ends: 1661 [2022-04-08 14:54:46,900 INFO L226 Difference]: Without dead ends: 971 [2022-04-08 14:54:46,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:46,903 INFO L913 BasicCegarLoop]: 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-08 14:54:46,904 INFO L914 BasicCegarLoop]: 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-08 14:54:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-08 14:54:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-08 14:54:46,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:46,974 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-08 14:54:46,975 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-08 14:54:46,976 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-08 14:54:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:47,003 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-08 14:54:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-08 14:54:47,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:47,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:47,006 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-08 14:54:47,007 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-08 14:54:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:47,034 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-08 14:54:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-08 14:54:47,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:47,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:47,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:47,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:47,037 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-08 14:54:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1527 transitions. [2022-04-08 14:54:47,077 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1527 transitions. Word has length 25 [2022-04-08 14:54:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:47,077 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1527 transitions. [2022-04-08 14:54:47,080 INFO L479 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-08 14:54:47,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1527 transitions. [2022-04-08 14:54:48,425 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-08 14:54:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1527 transitions. [2022-04-08 14:54:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:54:48,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:48,426 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:48,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 14:54:48,426 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 1 times [2022-04-08 14:54:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:48,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [580546748] [2022-04-08 14:54:48,427 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 2 times [2022-04-08 14:54:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:48,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477500122] [2022-04-08 14:54:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:48,467 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-08 14:54:48,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-08 14:54:48,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-08 14:54:48,467 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-08 14:54:48,467 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-08 14:54:48,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-08 14:54:48,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-08 14:54:48,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {30736#true} call #t~ret15 := main(); {30736#true} is VALID [2022-04-08 14:54:48,468 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-08 14:54:48,468 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-08 14:54:48,468 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-08 14:54:48,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {30736#true} assume !(0 != ~p1~0); {30736#true} is VALID [2022-04-08 14:54:48,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {30736#true} assume !(0 != ~p2~0); {30736#true} is VALID [2022-04-08 14:54:48,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {30736#true} assume !(0 != ~p3~0); {30736#true} is VALID [2022-04-08 14:54:48,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {30736#true} assume !(0 != ~p4~0); {30736#true} is VALID [2022-04-08 14:54:48,468 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-08 14:54:48,469 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-08 14:54:48,469 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-08 14:54:48,469 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-08 14:54:48,469 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-08 14:54:48,470 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-08 14:54:48,470 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-08 14:54:48,470 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-08 14:54:48,470 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-08 14:54:48,471 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-08 14:54:48,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {30737#false} is VALID [2022-04-08 14:54:48,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {30737#false} assume 0 != ~p6~0; {30737#false} is VALID [2022-04-08 14:54:48,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {30737#false} assume 1 != ~lk6~0; {30737#false} is VALID [2022-04-08 14:54:48,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {30737#false} assume !false; {30737#false} is VALID [2022-04-08 14:54:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:48,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477500122] [2022-04-08 14:54:48,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477500122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:48,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:48,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:48,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:48,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [580546748] [2022-04-08 14:54:48,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [580546748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:48,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:48,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:48,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902698094] [2022-04-08 14:54:48,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:48,473 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-08 14:54:48,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:48,473 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-08 14:54:48,487 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-08 14:54:48,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:48,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:48,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:48,488 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-08 14:54:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:48,757 INFO L93 Difference]: Finished difference Result 1453 states and 2281 transitions. [2022-04-08 14:54:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:48,757 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-08 14:54:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:48,758 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-08 14:54:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 14:54:48,759 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-08 14:54:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 14:54:48,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-08 14:54:48,867 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-08 14:54:48,912 INFO L225 Difference]: With dead ends: 1453 [2022-04-08 14:54:48,912 INFO L226 Difference]: Without dead ends: 987 [2022-04-08 14:54:48,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:48,913 INFO L913 BasicCegarLoop]: 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-08 14:54:48,913 INFO L914 BasicCegarLoop]: 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-08 14:54:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-08 14:54:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-08 14:54:48,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:48,970 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-08 14:54:48,971 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-08 14:54:48,972 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-08 14:54:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:48,998 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-08 14:54:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-08 14:54:48,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:48,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:49,000 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-08 14:54:49,001 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-08 14:54:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:49,028 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-08 14:54:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-08 14:54:49,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:49,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:49,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:49,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:49,030 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-08 14:54:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1527 transitions. [2022-04-08 14:54:49,069 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1527 transitions. Word has length 26 [2022-04-08 14:54:49,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:49,069 INFO L478 AbstractCegarLoop]: Abstraction has 985 states and 1527 transitions. [2022-04-08 14:54:49,070 INFO L479 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-08 14:54:49,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 985 states and 1527 transitions. [2022-04-08 14:54:50,394 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-08 14:54:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1527 transitions. [2022-04-08 14:54:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:54:50,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:50,395 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:50,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 14:54:50,395 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 1 times [2022-04-08 14:54:50,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:50,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703986364] [2022-04-08 14:54:50,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:50,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 2 times [2022-04-08 14:54:50,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:50,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375765123] [2022-04-08 14:54:50,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:50,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:50,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:50,447 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-08 14:54:50,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-08 14:54:50,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-08 14:54:50,450 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-08 14:54:50,450 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-08 14:54:50,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-08 14:54:50,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-08 14:54:50,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {37598#true} call #t~ret15 := main(); {37598#true} is VALID [2022-04-08 14:54:50,450 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-08 14:54:50,450 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-08 14:54:50,450 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-08 14:54:50,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {37598#true} assume !(0 != ~p1~0); {37598#true} is VALID [2022-04-08 14:54:50,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {37598#true} assume !(0 != ~p2~0); {37598#true} is VALID [2022-04-08 14:54:50,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {37598#true} assume !(0 != ~p3~0); {37598#true} is VALID [2022-04-08 14:54:50,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {37598#true} assume !(0 != ~p4~0); {37598#true} is VALID [2022-04-08 14:54:50,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {37598#true} assume !(0 != ~p5~0); {37598#true} is VALID [2022-04-08 14:54:50,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {37598#true} assume 0 != ~p6~0;~lk6~0 := 1; {37603#(= main_~lk6~0 1)} is VALID [2022-04-08 14:54:50,453 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-08 14:54:50,453 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-08 14:54:50,453 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-08 14:54:50,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-08 14:54:50,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-08 14:54:50,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-08 14:54:50,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-08 14:54:50,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-08 14:54:50,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {37603#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {37603#(= main_~lk6~0 1)} is VALID [2022-04-08 14:54:50,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {37603#(= main_~lk6~0 1)} assume 0 != ~p6~0; {37603#(= main_~lk6~0 1)} is VALID [2022-04-08 14:54:50,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {37603#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {37599#false} is VALID [2022-04-08 14:54:50,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {37599#false} assume !false; {37599#false} is VALID [2022-04-08 14:54:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375765123] [2022-04-08 14:54:50,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375765123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:50,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:50,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:50,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703986364] [2022-04-08 14:54:50,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703986364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:50,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:50,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:50,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499411890] [2022-04-08 14:54:50,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:50,457 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-08 14:54:50,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:50,457 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-08 14:54:50,471 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-08 14:54:50,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:50,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:50,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:50,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:50,472 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-08 14:54:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:50,812 INFO L93 Difference]: Finished difference Result 1741 states and 2745 transitions. [2022-04-08 14:54:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:50,812 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-08 14:54:50,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:50,813 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-08 14:54:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 14:54:50,814 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-08 14:54:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 14:54:50,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-08 14:54:50,894 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-08 14:54:51,017 INFO L225 Difference]: With dead ends: 1741 [2022-04-08 14:54:51,017 INFO L226 Difference]: Without dead ends: 1739 [2022-04-08 14:54:51,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:51,017 INFO L913 BasicCegarLoop]: 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-08 14:54:51,018 INFO L914 BasicCegarLoop]: 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-08 14:54:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-08 14:54:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-08 14:54:51,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:51,108 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-08 14:54:51,110 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-08 14:54:51,112 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-08 14:54:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:51,190 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-08 14:54:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-08 14:54:51,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:51,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:51,194 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-08 14:54:51,195 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-08 14:54:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:51,275 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-08 14:54:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-08 14:54:51,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:51,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:51,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:51,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:51,278 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-08 14:54:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2022-04-08 14:54:51,354 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 26 [2022-04-08 14:54:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:51,354 INFO L478 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2022-04-08 14:54:51,354 INFO L479 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-08 14:54:51,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1417 states and 2135 transitions. [2022-04-08 14:54:53,273 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-08 14:54:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2022-04-08 14:54:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:54:53,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:53,275 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:53,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 14:54:53,275 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:53,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 1 times [2022-04-08 14:54:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:53,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1699267480] [2022-04-08 14:54:53,275 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 2 times [2022-04-08 14:54:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:53,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520430560] [2022-04-08 14:54:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:53,324 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-08 14:54:53,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-08 14:54:53,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-08 14:54:53,325 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-08 14:54:53,325 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-08 14:54:53,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-08 14:54:53,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-08 14:54:53,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {47404#true} call #t~ret15 := main(); {47404#true} is VALID [2022-04-08 14:54:53,325 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-08 14:54:53,325 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-08 14:54:53,325 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-08 14:54:53,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {47404#true} assume !(0 != ~p1~0); {47404#true} is VALID [2022-04-08 14:54:53,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {47404#true} assume !(0 != ~p2~0); {47404#true} is VALID [2022-04-08 14:54:53,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {47404#true} assume !(0 != ~p3~0); {47404#true} is VALID [2022-04-08 14:54:53,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {47404#true} assume !(0 != ~p4~0); {47404#true} is VALID [2022-04-08 14:54:53,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {47404#true} assume !(0 != ~p5~0); {47404#true} is VALID [2022-04-08 14:54:53,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {47404#true} assume !(0 != ~p6~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-08 14:54:53,326 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-08 14:54:53,326 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-08 14:54:53,327 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-08 14:54:53,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p10~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-08 14:54:53,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p1~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-08 14:54:53,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p2~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-08 14:54:53,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p3~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-08 14:54:53,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p4~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-08 14:54:53,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {47409#(= main_~p6~0 0)} assume !(0 != ~p5~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-08 14:54:53,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p6~0; {47405#false} is VALID [2022-04-08 14:54:53,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {47405#false} assume 1 != ~lk6~0; {47405#false} is VALID [2022-04-08 14:54:53,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {47405#false} assume !false; {47405#false} is VALID [2022-04-08 14:54:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:53,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520430560] [2022-04-08 14:54:53,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520430560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:53,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:53,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:53,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:53,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1699267480] [2022-04-08 14:54:53,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1699267480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:53,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:53,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105340651] [2022-04-08 14:54:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:53,333 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-08 14:54:53,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:53,333 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-08 14:54:53,347 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-08 14:54:53,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:53,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:53,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:53,347 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-08 14:54:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:54,082 INFO L93 Difference]: Finished difference Result 3277 states and 4953 transitions. [2022-04-08 14:54:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:54,082 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-08 14:54:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:54,082 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-08 14:54:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-08 14:54:54,083 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-08 14:54:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-08 14:54:54,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-08 14:54:54,207 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-08 14:54:54,353 INFO L225 Difference]: With dead ends: 3277 [2022-04-08 14:54:54,353 INFO L226 Difference]: Without dead ends: 1899 [2022-04-08 14:54:54,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:54,355 INFO L913 BasicCegarLoop]: 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-08 14:54:54,356 INFO L914 BasicCegarLoop]: 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-08 14:54:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-08 14:54:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-08 14:54:54,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:54,493 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-08 14:54:54,494 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-08 14:54:54,496 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-08 14:54:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:54,584 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-08 14:54:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-08 14:54:54,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:54,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:54,588 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-08 14:54:54,589 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-08 14:54:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:54,678 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-08 14:54:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-08 14:54:54,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:54,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:54,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:54,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:54,683 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-08 14:54:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2823 transitions. [2022-04-08 14:54:54,831 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2823 transitions. Word has length 26 [2022-04-08 14:54:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:54,831 INFO L478 AbstractCegarLoop]: Abstraction has 1897 states and 2823 transitions. [2022-04-08 14:54:54,831 INFO L479 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-08 14:54:54,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1897 states and 2823 transitions. [2022-04-08 14:54:57,428 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-08 14:54:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2823 transitions. [2022-04-08 14:54:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:54:57,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:54:57,429 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:54:57,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 14:54:57,430 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:54:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:54:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 1 times [2022-04-08 14:54:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:57,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791843291] [2022-04-08 14:54:57,430 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:54:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 2 times [2022-04-08 14:54:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:54:57,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150127436] [2022-04-08 14:54:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:54:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:54:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:57,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:54:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:54:57,464 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-08 14:54:57,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-08 14:54:57,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-08 14:54:57,465 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-08 14:54:57,465 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-08 14:54:57,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-08 14:54:57,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-08 14:54:57,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {61562#true} call #t~ret15 := main(); {61562#true} is VALID [2022-04-08 14:54:57,465 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-08 14:54:57,465 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-08 14:54:57,465 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-08 14:54:57,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {61562#true} assume !(0 != ~p1~0); {61562#true} is VALID [2022-04-08 14:54:57,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {61562#true} assume !(0 != ~p2~0); {61562#true} is VALID [2022-04-08 14:54:57,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {61562#true} assume !(0 != ~p3~0); {61562#true} is VALID [2022-04-08 14:54:57,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {61562#true} assume !(0 != ~p4~0); {61562#true} is VALID [2022-04-08 14:54:57,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {61562#true} assume !(0 != ~p5~0); {61562#true} is VALID [2022-04-08 14:54:57,466 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-08 14:54:57,466 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-08 14:54:57,466 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-08 14:54:57,467 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-08 14:54:57,467 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-08 14:54:57,467 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-08 14:54:57,467 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-08 14:54:57,468 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-08 14:54:57,468 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-08 14:54:57,468 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-08 14:54:57,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {61563#false} is VALID [2022-04-08 14:54:57,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {61563#false} assume 0 != ~p7~0; {61563#false} is VALID [2022-04-08 14:54:57,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {61563#false} assume 1 != ~lk7~0; {61563#false} is VALID [2022-04-08 14:54:57,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {61563#false} assume !false; {61563#false} is VALID [2022-04-08 14:54:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:54:57,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:54:57,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150127436] [2022-04-08 14:54:57,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150127436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:57,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:57,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:57,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:54:57,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791843291] [2022-04-08 14:54:57,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791843291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:54:57,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:54:57,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:54:57,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717837035] [2022-04-08 14:54:57,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:54:57,470 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-08 14:54:57,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:54:57,470 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-08 14:54:57,484 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-08 14:54:57,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:54:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:54:57,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:54:57,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:54:57,484 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-08 14:54:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:58,036 INFO L93 Difference]: Finished difference Result 2845 states and 4217 transitions. [2022-04-08 14:54:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:54:58,036 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-08 14:54:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:54:58,036 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-08 14:54:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-08 14:54:58,038 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-08 14:54:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-08 14:54:58,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-08 14:54:58,137 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-08 14:54:58,307 INFO L225 Difference]: With dead ends: 2845 [2022-04-08 14:54:58,307 INFO L226 Difference]: Without dead ends: 1931 [2022-04-08 14:54:58,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:54:58,309 INFO L913 BasicCegarLoop]: 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-08 14:54:58,309 INFO L914 BasicCegarLoop]: 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-08 14:54:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-08 14:54:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-08 14:54:58,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:54:58,454 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-08 14:54:58,455 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-08 14:54:58,457 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-08 14:54:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:58,547 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-08 14:54:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-08 14:54:58,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:58,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:58,551 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-08 14:54:58,553 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-08 14:54:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:54:58,643 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-08 14:54:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-08 14:54:58,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:54:58,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:54:58,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:54:58,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:54:58,648 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-08 14:54:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2823 transitions. [2022-04-08 14:54:58,798 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2823 transitions. Word has length 27 [2022-04-08 14:54:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:54:58,799 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 2823 transitions. [2022-04-08 14:54:58,799 INFO L479 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-08 14:54:58,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 2823 transitions. [2022-04-08 14:55:01,483 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-08 14:55:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2823 transitions. [2022-04-08 14:55:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:55:01,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:01,485 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:01,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 14:55:01,485 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:01,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 1 times [2022-04-08 14:55:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:01,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [790731039] [2022-04-08 14:55:01,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 2 times [2022-04-08 14:55:01,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:01,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294177058] [2022-04-08 14:55:01,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:01,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:01,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:01,518 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-08 14:55:01,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-08 14:55:01,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-08 14:55:01,518 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-08 14:55:01,519 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-08 14:55:01,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-08 14:55:01,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-08 14:55:01,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {74984#true} call #t~ret15 := main(); {74984#true} is VALID [2022-04-08 14:55:01,519 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-08 14:55:01,520 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-08 14:55:01,520 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-08 14:55:01,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {74984#true} assume !(0 != ~p1~0); {74984#true} is VALID [2022-04-08 14:55:01,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {74984#true} assume !(0 != ~p2~0); {74984#true} is VALID [2022-04-08 14:55:01,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {74984#true} assume !(0 != ~p3~0); {74984#true} is VALID [2022-04-08 14:55:01,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {74984#true} assume !(0 != ~p4~0); {74984#true} is VALID [2022-04-08 14:55:01,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {74984#true} assume !(0 != ~p5~0); {74984#true} is VALID [2022-04-08 14:55:01,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {74984#true} assume !(0 != ~p6~0); {74984#true} is VALID [2022-04-08 14:55:01,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {74984#true} assume 0 != ~p7~0;~lk7~0 := 1; {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,521 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-08 14:55:01,522 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-08 14:55:01,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {74989#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {74989#(= main_~lk7~0 1)} assume 0 != ~p7~0; {74989#(= main_~lk7~0 1)} is VALID [2022-04-08 14:55:01,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {74989#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {74985#false} is VALID [2022-04-08 14:55:01,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {74985#false} assume !false; {74985#false} is VALID [2022-04-08 14:55:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:01,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:01,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294177058] [2022-04-08 14:55:01,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294177058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:01,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:01,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:01,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:01,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [790731039] [2022-04-08 14:55:01,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [790731039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:01,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:01,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730644896] [2022-04-08 14:55:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:01,526 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-08 14:55:01,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:01,526 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-08 14:55:01,540 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-08 14:55:01,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:01,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:01,541 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-08 14:55:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:02,370 INFO L93 Difference]: Finished difference Result 3341 states and 4969 transitions. [2022-04-08 14:55:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:02,370 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-08 14:55:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:02,371 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-08 14:55:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-08 14:55:02,371 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-08 14:55:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-08 14:55:02,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-08 14:55:02,434 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-08 14:55:02,904 INFO L225 Difference]: With dead ends: 3341 [2022-04-08 14:55:02,905 INFO L226 Difference]: Without dead ends: 3339 [2022-04-08 14:55:02,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:02,906 INFO L913 BasicCegarLoop]: 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-08 14:55:02,906 INFO L914 BasicCegarLoop]: 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-08 14:55:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-08 14:55:03,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-08 14:55:03,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:03,100 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-08 14:55:03,103 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-08 14:55:03,105 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-08 14:55:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:03,394 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-08 14:55:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-08 14:55:03,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:03,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:03,401 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-08 14:55:03,403 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-08 14:55:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:03,692 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-08 14:55:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-08 14:55:03,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:03,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:03,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:03,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:03,698 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-08 14:55:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4007 transitions. [2022-04-08 14:55:04,056 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4007 transitions. Word has length 27 [2022-04-08 14:55:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:04,056 INFO L478 AbstractCegarLoop]: Abstraction has 2825 states and 4007 transitions. [2022-04-08 14:55:04,056 INFO L479 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-08 14:55:04,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2825 states and 4007 transitions. [2022-04-08 14:55:07,847 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-08 14:55:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4007 transitions. [2022-04-08 14:55:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:55:07,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:07,850 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:07,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 14:55:07,850 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 1 times [2022-04-08 14:55:07,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:07,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37763000] [2022-04-08 14:55:07,851 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 2 times [2022-04-08 14:55:07,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:07,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998369242] [2022-04-08 14:55:07,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:07,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:07,879 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-08 14:55:07,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-08 14:55:07,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-08 14:55:07,880 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-08 14:55:07,880 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-08 14:55:07,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-08 14:55:07,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-08 14:55:07,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {94006#true} call #t~ret15 := main(); {94006#true} is VALID [2022-04-08 14:55:07,880 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-08 14:55:07,880 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-08 14:55:07,880 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-08 14:55:07,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {94006#true} assume !(0 != ~p1~0); {94006#true} is VALID [2022-04-08 14:55:07,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {94006#true} assume !(0 != ~p2~0); {94006#true} is VALID [2022-04-08 14:55:07,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {94006#true} assume !(0 != ~p3~0); {94006#true} is VALID [2022-04-08 14:55:07,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {94006#true} assume !(0 != ~p4~0); {94006#true} is VALID [2022-04-08 14:55:07,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {94006#true} assume !(0 != ~p5~0); {94006#true} is VALID [2022-04-08 14:55:07,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {94006#true} assume !(0 != ~p6~0); {94006#true} is VALID [2022-04-08 14:55:07,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {94006#true} assume !(0 != ~p7~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 14:55:07,888 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-08 14:55:07,888 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-08 14:55:07,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p10~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 14:55:07,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p1~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 14:55:07,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p2~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 14:55:07,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p3~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 14:55:07,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p4~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 14:55:07,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p5~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 14:55:07,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {94011#(= main_~p7~0 0)} assume !(0 != ~p6~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 14:55:07,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p7~0; {94007#false} is VALID [2022-04-08 14:55:07,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {94007#false} assume 1 != ~lk7~0; {94007#false} is VALID [2022-04-08 14:55:07,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {94007#false} assume !false; {94007#false} is VALID [2022-04-08 14:55:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:07,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998369242] [2022-04-08 14:55:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998369242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:07,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:07,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:07,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37763000] [2022-04-08 14:55:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37763000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:07,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:07,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185473345] [2022-04-08 14:55:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:07,892 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-08 14:55:07,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:07,892 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-08 14:55:07,922 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-08 14:55:07,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:07,923 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-08 14:55:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:10,178 INFO L93 Difference]: Finished difference Result 6477 states and 9193 transitions. [2022-04-08 14:55:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:10,178 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-08 14:55:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:10,178 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-08 14:55:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-08 14:55:10,179 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-08 14:55:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-08 14:55:10,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-08 14:55:10,274 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-08 14:55:10,845 INFO L225 Difference]: With dead ends: 6477 [2022-04-08 14:55:10,845 INFO L226 Difference]: Without dead ends: 3723 [2022-04-08 14:55:10,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:10,848 INFO L913 BasicCegarLoop]: 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-08 14:55:10,848 INFO L914 BasicCegarLoop]: 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-08 14:55:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-08 14:55:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-08 14:55:11,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:11,119 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-08 14:55:11,121 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-08 14:55:11,123 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-08 14:55:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:11,477 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-08 14:55:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-08 14:55:11,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:11,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:11,484 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-08 14:55:11,487 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-08 14:55:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:11,830 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-08 14:55:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-08 14:55:11,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:11,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:11,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:11,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:11,838 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-08 14:55:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5191 transitions. [2022-04-08 14:55:12,443 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5191 transitions. Word has length 27 [2022-04-08 14:55:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:12,443 INFO L478 AbstractCegarLoop]: Abstraction has 3721 states and 5191 transitions. [2022-04-08 14:55:12,443 INFO L479 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-08 14:55:12,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3721 states and 5191 transitions. [2022-04-08 14:55:17,427 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-08 14:55:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5191 transitions. [2022-04-08 14:55:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:55:17,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:17,430 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:17,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 14:55:17,431 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 1 times [2022-04-08 14:55:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:17,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [797790829] [2022-04-08 14:55:17,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 2 times [2022-04-08 14:55:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:17,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791487202] [2022-04-08 14:55:17,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:17,463 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-08 14:55:17,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-08 14:55:17,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-08 14:55:17,464 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-08 14:55:17,464 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-08 14:55:17,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-08 14:55:17,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-08 14:55:17,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {121860#true} call #t~ret15 := main(); {121860#true} is VALID [2022-04-08 14:55:17,464 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-08 14:55:17,464 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-08 14:55:17,464 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-08 14:55:17,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {121860#true} assume !(0 != ~p1~0); {121860#true} is VALID [2022-04-08 14:55:17,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {121860#true} assume !(0 != ~p2~0); {121860#true} is VALID [2022-04-08 14:55:17,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {121860#true} assume !(0 != ~p3~0); {121860#true} is VALID [2022-04-08 14:55:17,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {121860#true} assume !(0 != ~p4~0); {121860#true} is VALID [2022-04-08 14:55:17,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {121860#true} assume !(0 != ~p5~0); {121860#true} is VALID [2022-04-08 14:55:17,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {121860#true} assume !(0 != ~p6~0); {121860#true} is VALID [2022-04-08 14:55:17,465 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-08 14:55:17,465 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-08 14:55:17,465 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-08 14:55:17,466 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-08 14:55:17,466 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-08 14:55:17,466 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-08 14:55:17,466 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-08 14:55:17,467 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-08 14:55:17,467 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-08 14:55:17,467 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-08 14:55:17,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {121861#false} is VALID [2022-04-08 14:55:17,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {121861#false} assume 0 != ~p8~0; {121861#false} is VALID [2022-04-08 14:55:17,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {121861#false} assume 1 != ~lk8~0; {121861#false} is VALID [2022-04-08 14:55:17,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {121861#false} assume !false; {121861#false} is VALID [2022-04-08 14:55:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:17,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:17,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791487202] [2022-04-08 14:55:17,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791487202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:17,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:17,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:17,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:17,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [797790829] [2022-04-08 14:55:17,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [797790829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:17,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:17,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:17,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333493837] [2022-04-08 14:55:17,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:17,469 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-08 14:55:17,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:17,469 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-08 14:55:17,483 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-08 14:55:17,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:17,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:17,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:17,483 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-08 14:55:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:19,116 INFO L93 Difference]: Finished difference Result 5581 states and 7753 transitions. [2022-04-08 14:55:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:19,116 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-08 14:55:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:19,116 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-08 14:55:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-08 14:55:19,117 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-08 14:55:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-08 14:55:19,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-08 14:55:19,210 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-08 14:55:19,806 INFO L225 Difference]: With dead ends: 5581 [2022-04-08 14:55:19,806 INFO L226 Difference]: Without dead ends: 3787 [2022-04-08 14:55:19,808 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:19,809 INFO L913 BasicCegarLoop]: 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-08 14:55:19,809 INFO L914 BasicCegarLoop]: 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-08 14:55:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-08 14:55:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-08 14:55:20,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:20,081 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-08 14:55:20,083 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-08 14:55:20,086 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-08 14:55:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:20,445 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-08 14:55:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-08 14:55:20,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:20,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:20,452 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-08 14:55:20,454 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-08 14:55:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:20,817 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-08 14:55:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-08 14:55:20,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:20,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:20,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:20,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:20,825 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-08 14:55:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5191 transitions. [2022-04-08 14:55:21,478 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5191 transitions. Word has length 28 [2022-04-08 14:55:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:21,478 INFO L478 AbstractCegarLoop]: Abstraction has 3785 states and 5191 transitions. [2022-04-08 14:55:21,478 INFO L479 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-08 14:55:21,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3785 states and 5191 transitions. [2022-04-08 14:55:26,487 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-08 14:55:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5191 transitions. [2022-04-08 14:55:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:55:26,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:26,490 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:26,490 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 14:55:26,490 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:26,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 1 times [2022-04-08 14:55:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:26,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1671410043] [2022-04-08 14:55:26,491 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:26,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 2 times [2022-04-08 14:55:26,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:26,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590679613] [2022-04-08 14:55:26,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:26,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:26,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:26,516 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-08 14:55:26,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-08 14:55:26,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-08 14:55:26,517 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-08 14:55:26,517 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-08 14:55:26,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-08 14:55:26,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-08 14:55:26,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {148178#true} call #t~ret15 := main(); {148178#true} is VALID [2022-04-08 14:55:26,517 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-08 14:55:26,517 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-08 14:55:26,517 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-08 14:55:26,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {148178#true} assume !(0 != ~p1~0); {148178#true} is VALID [2022-04-08 14:55:26,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {148178#true} assume !(0 != ~p2~0); {148178#true} is VALID [2022-04-08 14:55:26,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {148178#true} assume !(0 != ~p3~0); {148178#true} is VALID [2022-04-08 14:55:26,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {148178#true} assume !(0 != ~p4~0); {148178#true} is VALID [2022-04-08 14:55:26,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {148178#true} assume !(0 != ~p5~0); {148178#true} is VALID [2022-04-08 14:55:26,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {148178#true} assume !(0 != ~p6~0); {148178#true} is VALID [2022-04-08 14:55:26,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {148178#true} assume !(0 != ~p7~0); {148178#true} is VALID [2022-04-08 14:55:26,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {148178#true} assume 0 != ~p8~0;~lk8~0 := 1; {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,518 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-08 14:55:26,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {148183#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {148183#(= main_~lk8~0 1)} assume 0 != ~p8~0; {148183#(= main_~lk8~0 1)} is VALID [2022-04-08 14:55:26,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {148183#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {148179#false} is VALID [2022-04-08 14:55:26,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {148179#false} assume !false; {148179#false} is VALID [2022-04-08 14:55:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:26,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590679613] [2022-04-08 14:55:26,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590679613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:26,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:26,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:26,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:26,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1671410043] [2022-04-08 14:55:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1671410043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:26,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016350995] [2022-04-08 14:55:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:26,522 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-08 14:55:26,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:26,522 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-08 14:55:26,536 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-08 14:55:26,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:26,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:26,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:26,537 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-08 14:55:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:28,876 INFO L93 Difference]: Finished difference Result 6413 states and 8905 transitions. [2022-04-08 14:55:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:28,876 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-08 14:55:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:28,876 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-08 14:55:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 14:55:28,877 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-08 14:55:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 14:55:28,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 14:55:28,939 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-08 14:55:30,714 INFO L225 Difference]: With dead ends: 6413 [2022-04-08 14:55:30,714 INFO L226 Difference]: Without dead ends: 6411 [2022-04-08 14:55:30,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:30,716 INFO L913 BasicCegarLoop]: 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-08 14:55:30,716 INFO L914 BasicCegarLoop]: 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-08 14:55:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-08 14:55:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-08 14:55:31,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:31,123 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-08 14:55:31,127 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-08 14:55:31,131 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-08 14:55:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:32,225 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-08 14:55:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-08 14:55:32,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:32,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:32,238 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-08 14:55:32,242 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-08 14:55:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:33,335 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-08 14:55:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-08 14:55:33,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:33,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:33,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:33,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:33,346 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-08 14:55:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7495 transitions. [2022-04-08 14:55:34,626 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7495 transitions. Word has length 28 [2022-04-08 14:55:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:34,627 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 7495 transitions. [2022-04-08 14:55:34,627 INFO L479 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-08 14:55:34,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 7495 transitions. [2022-04-08 14:55:41,969 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-08 14:55:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7495 transitions. [2022-04-08 14:55:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:55:41,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:41,973 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:41,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 14:55:41,973 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:41,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 1 times [2022-04-08 14:55:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:41,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2292915] [2022-04-08 14:55:41,974 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 2 times [2022-04-08 14:55:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:41,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245383227] [2022-04-08 14:55:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:42,005 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-08 14:55:42,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-08 14:55:42,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-08 14:55:42,005 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-08 14:55:42,005 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-08 14:55:42,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-08 14:55:42,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-08 14:55:42,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {185120#true} call #t~ret15 := main(); {185120#true} is VALID [2022-04-08 14:55:42,005 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-08 14:55:42,006 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-08 14:55:42,006 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-08 14:55:42,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {185120#true} assume !(0 != ~p1~0); {185120#true} is VALID [2022-04-08 14:55:42,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {185120#true} assume !(0 != ~p2~0); {185120#true} is VALID [2022-04-08 14:55:42,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {185120#true} assume !(0 != ~p3~0); {185120#true} is VALID [2022-04-08 14:55:42,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {185120#true} assume !(0 != ~p4~0); {185120#true} is VALID [2022-04-08 14:55:42,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {185120#true} assume !(0 != ~p5~0); {185120#true} is VALID [2022-04-08 14:55:42,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {185120#true} assume !(0 != ~p6~0); {185120#true} is VALID [2022-04-08 14:55:42,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {185120#true} assume !(0 != ~p7~0); {185120#true} is VALID [2022-04-08 14:55:42,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {185120#true} assume !(0 != ~p8~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,006 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-08 14:55:42,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p10~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p1~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p2~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p3~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p4~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p5~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p6~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {185125#(= main_~p8~0 0)} assume !(0 != ~p7~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 14:55:42,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {185125#(= main_~p8~0 0)} assume 0 != ~p8~0; {185121#false} is VALID [2022-04-08 14:55:42,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {185121#false} assume 1 != ~lk8~0; {185121#false} is VALID [2022-04-08 14:55:42,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {185121#false} assume !false; {185121#false} is VALID [2022-04-08 14:55:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245383227] [2022-04-08 14:55:42,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245383227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:42,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:42,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:42,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:42,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2292915] [2022-04-08 14:55:42,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2292915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:42,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:42,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:42,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942412024] [2022-04-08 14:55:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:42,010 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-08 14:55:42,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:42,010 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-08 14:55:42,025 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-08 14:55:42,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:42,025 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-08 14:55:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:49,896 INFO L93 Difference]: Finished difference Result 12813 states and 16969 transitions. [2022-04-08 14:55:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:49,896 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-08 14:55:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:49,896 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-08 14:55:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 14:55:49,897 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-08 14:55:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 14:55:49,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-08 14:55:49,991 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-08 14:55:52,243 INFO L225 Difference]: With dead ends: 12813 [2022-04-08 14:55:52,243 INFO L226 Difference]: Without dead ends: 7307 [2022-04-08 14:55:52,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:52,249 INFO L913 BasicCegarLoop]: 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-08 14:55:52,250 INFO L914 BasicCegarLoop]: 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-08 14:55:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-08 14:55:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-08 14:55:52,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:52,784 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-08 14:55:52,790 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-08 14:55:52,796 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-08 14:55:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:54,094 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-08 14:55:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-08 14:55:54,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:54,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:54,107 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-08 14:55:54,113 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-08 14:55:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:55,513 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-08 14:55:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-08 14:55:55,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:55,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:55,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:55,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:55,526 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-08 14:55:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9479 transitions. [2022-04-08 14:55:57,881 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9479 transitions. Word has length 28 [2022-04-08 14:55:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:57,881 INFO L478 AbstractCegarLoop]: Abstraction has 7305 states and 9479 transitions. [2022-04-08 14:55:57,881 INFO L479 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-08 14:55:57,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7305 states and 9479 transitions. [2022-04-08 14:56:07,436 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-08 14:56:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9479 transitions. [2022-04-08 14:56:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:56:07,440 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:56:07,440 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:56:07,441 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 14:56:07,441 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:56:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:56:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 1 times [2022-04-08 14:56:07,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:07,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [289734408] [2022-04-08 14:56:07,441 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:56:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 2 times [2022-04-08 14:56:07,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:56:07,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110892491] [2022-04-08 14:56:07,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:56:07,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:56:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:07,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:56:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:07,474 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-08 14:56:07,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-08 14:56:07,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-08 14:56:07,474 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-08 14:56:07,474 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-08 14:56:07,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-08 14:56:07,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-08 14:56:07,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {239982#true} call #t~ret15 := main(); {239982#true} is VALID [2022-04-08 14:56:07,475 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-08 14:56:07,475 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-08 14:56:07,475 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-08 14:56:07,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {239982#true} assume !(0 != ~p1~0); {239982#true} is VALID [2022-04-08 14:56:07,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {239982#true} assume !(0 != ~p2~0); {239982#true} is VALID [2022-04-08 14:56:07,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {239982#true} assume !(0 != ~p3~0); {239982#true} is VALID [2022-04-08 14:56:07,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {239982#true} assume !(0 != ~p4~0); {239982#true} is VALID [2022-04-08 14:56:07,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {239982#true} assume !(0 != ~p5~0); {239982#true} is VALID [2022-04-08 14:56:07,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {239982#true} assume !(0 != ~p6~0); {239982#true} is VALID [2022-04-08 14:56:07,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {239982#true} assume !(0 != ~p7~0); {239982#true} is VALID [2022-04-08 14:56:07,476 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-08 14:56:07,476 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-08 14:56:07,476 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-08 14:56:07,476 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-08 14:56:07,477 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-08 14:56:07,477 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-08 14:56:07,477 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-08 14:56:07,477 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-08 14:56:07,478 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-08 14:56:07,478 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-08 14:56:07,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {239983#false} is VALID [2022-04-08 14:56:07,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {239983#false} assume 0 != ~p9~0; {239983#false} is VALID [2022-04-08 14:56:07,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {239983#false} assume 1 != ~lk9~0; {239983#false} is VALID [2022-04-08 14:56:07,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {239983#false} assume !false; {239983#false} is VALID [2022-04-08 14:56:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:56:07,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:56:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110892491] [2022-04-08 14:56:07,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110892491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:07,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:07,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:07,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:56:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [289734408] [2022-04-08 14:56:07,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [289734408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:07,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:07,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095203747] [2022-04-08 14:56:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:56:07,480 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-08 14:56:07,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:56:07,480 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-08 14:56:07,494 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-08 14:56:07,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:56:07,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:07,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:56:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:56:07,495 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-08 14:56:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:12,894 INFO L93 Difference]: Finished difference Result 10957 states and 14153 transitions. [2022-04-08 14:56:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:56:12,894 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-08 14:56:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:56:12,894 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-08 14:56:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-08 14:56:12,895 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-08 14:56:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-08 14:56:12,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-08 14:56:12,988 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-08 14:56:15,360 INFO L225 Difference]: With dead ends: 10957 [2022-04-08 14:56:15,361 INFO L226 Difference]: Without dead ends: 7435 [2022-04-08 14:56:15,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:56:15,365 INFO L913 BasicCegarLoop]: 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-08 14:56:15,365 INFO L914 BasicCegarLoop]: 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-08 14:56:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-08 14:56:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-08 14:56:15,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:56:15,925 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-08 14:56:15,934 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-08 14:56:15,943 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-08 14:56:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:17,306 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-08 14:56:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-08 14:56:17,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:17,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:17,320 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-08 14:56:17,328 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-08 14:56:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:18,707 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-08 14:56:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-08 14:56:18,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:18,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:18,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:56:18,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:56:18,722 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-08 14:56:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9479 transitions. [2022-04-08 14:56:21,079 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9479 transitions. Word has length 29 [2022-04-08 14:56:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:56:21,079 INFO L478 AbstractCegarLoop]: Abstraction has 7433 states and 9479 transitions. [2022-04-08 14:56:21,079 INFO L479 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-08 14:56:21,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7433 states and 9479 transitions. [2022-04-08 14:56:30,595 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-08 14:56:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9479 transitions. [2022-04-08 14:56:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:56:30,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:56:30,599 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:56:30,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 14:56:30,599 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:56:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:56:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 1 times [2022-04-08 14:56:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538865934] [2022-04-08 14:56:30,600 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:56:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 2 times [2022-04-08 14:56:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:56:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468899494] [2022-04-08 14:56:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:56:30,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:56:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:56:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:30,630 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-08 14:56:30,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-08 14:56:30,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-08 14:56:30,631 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-08 14:56:30,631 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-08 14:56:30,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-08 14:56:30,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-08 14:56:30,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {291644#true} call #t~ret15 := main(); {291644#true} is VALID [2022-04-08 14:56:30,631 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-08 14:56:30,631 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-08 14:56:30,631 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-08 14:56:30,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {291644#true} assume !(0 != ~p1~0); {291644#true} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {291644#true} assume !(0 != ~p2~0); {291644#true} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {291644#true} assume !(0 != ~p3~0); {291644#true} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {291644#true} assume !(0 != ~p4~0); {291644#true} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {291644#true} assume !(0 != ~p5~0); {291644#true} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {291644#true} assume !(0 != ~p6~0); {291644#true} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {291644#true} assume !(0 != ~p7~0); {291644#true} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {291644#true} assume !(0 != ~p8~0); {291644#true} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {291644#true} assume 0 != ~p9~0;~lk9~0 := 1; {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {291649#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {291649#(= main_~lk9~0 1)} assume 0 != ~p9~0; {291649#(= main_~lk9~0 1)} is VALID [2022-04-08 14:56:30,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {291649#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {291645#false} is VALID [2022-04-08 14:56:30,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {291645#false} assume !false; {291645#false} is VALID [2022-04-08 14:56:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:56:30,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:56:30,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468899494] [2022-04-08 14:56:30,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468899494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:30,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:30,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:30,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:56:30,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538865934] [2022-04-08 14:56:30,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538865934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:30,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:30,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:30,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128852929] [2022-04-08 14:56:30,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:56:30,636 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-08 14:56:30,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:56:30,636 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-08 14:56:30,651 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-08 14:56:30,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:56:30,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:30,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:56:30,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:56:30,652 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-08 14:56:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:38,435 INFO L93 Difference]: Finished difference Result 12301 states and 15753 transitions. [2022-04-08 14:56:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:56:38,435 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-08 14:56:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:56:38,435 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-08 14:56:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 14:56:38,436 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-08 14:56:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 14:56:38,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-08 14:56:38,495 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-08 14:56:45,104 INFO L225 Difference]: With dead ends: 12301 [2022-04-08 14:56:45,105 INFO L226 Difference]: Without dead ends: 12299 [2022-04-08 14:56:45,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:56:45,107 INFO L913 BasicCegarLoop]: 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-08 14:56:45,107 INFO L914 BasicCegarLoop]: 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-08 14:56:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-08 14:56:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-08 14:56:45,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:56:46,001 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-08 14:56:46,011 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-08 14:56:46,022 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-08 14:56:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:50,205 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-08 14:56:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-08 14:56:50,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:50,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:50,227 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-08 14:56:50,239 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-08 14:56:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:54,506 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-08 14:56:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-08 14:56:54,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:54,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:54,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:56:54,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:56:54,528 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-08 14:56:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13959 transitions. [2022-04-08 14:56:59,693 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13959 transitions. Word has length 29 [2022-04-08 14:56:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:56:59,693 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 13959 transitions. [2022-04-08 14:56:59,693 INFO L479 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-08 14:56:59,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 13959 transitions. [2022-04-08 14:57:14,102 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-08 14:57:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13959 transitions. [2022-04-08 14:57:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:57:14,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:14,111 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:14,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 14:57:14,111 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 1 times [2022-04-08 14:57:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:14,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [955748963] [2022-04-08 14:57:14,113 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 2 times [2022-04-08 14:57:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:14,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890924457] [2022-04-08 14:57:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:14,166 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-08 14:57:14,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-08 14:57:14,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-08 14:57:14,167 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-08 14:57:14,167 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-08 14:57:14,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-08 14:57:14,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-08 14:57:14,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {363402#true} call #t~ret15 := main(); {363402#true} is VALID [2022-04-08 14:57:14,167 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-08 14:57:14,167 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-08 14:57:14,167 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-08 14:57:14,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {363402#true} assume !(0 != ~p1~0); {363402#true} is VALID [2022-04-08 14:57:14,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {363402#true} assume !(0 != ~p2~0); {363402#true} is VALID [2022-04-08 14:57:14,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {363402#true} assume !(0 != ~p3~0); {363402#true} is VALID [2022-04-08 14:57:14,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {363402#true} assume !(0 != ~p4~0); {363402#true} is VALID [2022-04-08 14:57:14,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {363402#true} assume !(0 != ~p5~0); {363402#true} is VALID [2022-04-08 14:57:14,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {363402#true} assume !(0 != ~p6~0); {363402#true} is VALID [2022-04-08 14:57:14,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {363402#true} assume !(0 != ~p7~0); {363402#true} is VALID [2022-04-08 14:57:14,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {363402#true} assume !(0 != ~p8~0); {363402#true} is VALID [2022-04-08 14:57:14,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {363402#true} assume !(0 != ~p9~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p10~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p1~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p2~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p3~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p4~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p5~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p6~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p7~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {363407#(= main_~p9~0 0)} assume !(0 != ~p8~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 14:57:14,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {363407#(= main_~p9~0 0)} assume 0 != ~p9~0; {363403#false} is VALID [2022-04-08 14:57:14,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {363403#false} assume 1 != ~lk9~0; {363403#false} is VALID [2022-04-08 14:57:14,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {363403#false} assume !false; {363403#false} is VALID [2022-04-08 14:57:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890924457] [2022-04-08 14:57:14,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890924457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:14,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:14,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:14,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:14,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [955748963] [2022-04-08 14:57:14,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [955748963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:14,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:14,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:14,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749033650] [2022-04-08 14:57:14,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:14,172 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-08 14:57:14,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:14,172 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-08 14:57:14,207 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-08 14:57:14,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:14,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:14,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:14,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:14,208 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-08 14:57:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:49,814 INFO L93 Difference]: Finished difference Result 25357 states and 31113 transitions. [2022-04-08 14:57:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:49,814 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-08 14:57:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:49,814 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-08 14:57:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-08 14:57:49,815 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-08 14:57:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-08 14:57:49,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-08 14:57:49,909 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-08 14:57:59,172 INFO L225 Difference]: With dead ends: 25357 [2022-04-08 14:57:59,172 INFO L226 Difference]: Without dead ends: 14347 [2022-04-08 14:57:59,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:59,184 INFO L913 BasicCegarLoop]: 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-08 14:57:59,185 INFO L914 BasicCegarLoop]: 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-08 14:57:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-08 14:58:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-08 14:58:00,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:00,267 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-08 14:58:00,285 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-08 14:58:00,302 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-08 14:58:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:05,468 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-08 14:58:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-08 14:58:05,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:05,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:05,492 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-08 14:58:05,503 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-08 14:58:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:10,399 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-08 14:58:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-08 14:58:10,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:10,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:10,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:10,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:10,422 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-08 14:58:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 17159 transitions. [2022-04-08 14:58:19,625 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 17159 transitions. Word has length 29 [2022-04-08 14:58:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:19,625 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 17159 transitions. [2022-04-08 14:58:19,626 INFO L479 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-08 14:58:19,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 17159 transitions. [2022-04-08 14:58:37,067 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-08 14:58:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 17159 transitions. [2022-04-08 14:58:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:58:37,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:37,076 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:37,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 14:58:37,076 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 1 times [2022-04-08 14:58:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:37,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389920036] [2022-04-08 14:58:37,077 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 2 times [2022-04-08 14:58:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:37,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051994013] [2022-04-08 14:58:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:37,110 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-08 14:58:37,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-08 14:58:37,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-08 14:58:37,111 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-08 14:58:37,111 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-08 14:58:37,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-08 14:58:37,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-08 14:58:37,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {471512#true} call #t~ret15 := main(); {471512#true} is VALID [2022-04-08 14:58:37,111 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-08 14:58:37,111 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-08 14:58:37,111 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-08 14:58:37,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {471512#true} assume !(0 != ~p1~0); {471512#true} is VALID [2022-04-08 14:58:37,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {471512#true} assume !(0 != ~p2~0); {471512#true} is VALID [2022-04-08 14:58:37,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {471512#true} assume !(0 != ~p3~0); {471512#true} is VALID [2022-04-08 14:58:37,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {471512#true} assume !(0 != ~p4~0); {471512#true} is VALID [2022-04-08 14:58:37,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {471512#true} assume !(0 != ~p5~0); {471512#true} is VALID [2022-04-08 14:58:37,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {471512#true} assume !(0 != ~p6~0); {471512#true} is VALID [2022-04-08 14:58:37,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {471512#true} assume !(0 != ~p7~0); {471512#true} is VALID [2022-04-08 14:58:37,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {471512#true} assume !(0 != ~p8~0); {471512#true} is VALID [2022-04-08 14:58:37,112 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-08 14:58:37,112 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-08 14:58:37,113 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-08 14:58:37,113 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-08 14:58:37,113 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-08 14:58:37,113 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-08 14:58:37,114 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-08 14:58:37,114 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-08 14:58:37,114 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-08 14:58:37,114 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-08 14:58:37,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {471513#false} is VALID [2022-04-08 14:58:37,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {471513#false} assume 0 != ~p10~0; {471513#false} is VALID [2022-04-08 14:58:37,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {471513#false} assume 1 != ~lk10~0; {471513#false} is VALID [2022-04-08 14:58:37,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {471513#false} assume !false; {471513#false} is VALID [2022-04-08 14:58:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:37,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:37,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051994013] [2022-04-08 14:58:37,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051994013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:37,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:37,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:37,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:37,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389920036] [2022-04-08 14:58:37,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389920036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:37,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:37,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:37,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618310056] [2022-04-08 14:58:37,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:37,116 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-08 14:58:37,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:37,116 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-08 14:58:37,131 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-08 14:58:37,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:37,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:37,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:37,132 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-08 14:58:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:58,273 INFO L93 Difference]: Finished difference Result 21517 states and 25609 transitions. [2022-04-08 14:58:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:58,274 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-08 14:58:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:58,274 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-08 14:58:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 14:58:58,275 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-08 14:58:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 14:58:58,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 14:58:58,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:07,682 INFO L225 Difference]: With dead ends: 21517 [2022-04-08 14:59:07,682 INFO L226 Difference]: Without dead ends: 14603 [2022-04-08 14:59:07,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:07,692 INFO L913 BasicCegarLoop]: 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-08 14:59:07,692 INFO L914 BasicCegarLoop]: 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-08 14:59:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-08 14:59:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-08 14:59:08,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:08,837 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-08 14:59:08,856 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-08 14:59:08,874 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-08 14:59:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:14,060 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-08 14:59:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-08 14:59:14,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:14,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:14,088 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-08 14:59:14,106 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-08 14:59:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:19,123 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-08 14:59:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-08 14:59:19,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:19,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:19,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:19,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:19,149 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-08 14:59:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 17159 transitions. [2022-04-08 14:59:28,841 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 17159 transitions. Word has length 30 [2022-04-08 14:59:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:28,841 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 17159 transitions. [2022-04-08 14:59:28,842 INFO L479 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-08 14:59:28,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 17159 transitions. [2022-04-08 14:59:46,329 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-08 14:59:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 17159 transitions. [2022-04-08 14:59:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:59:46,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:46,339 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:46,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 14:59:46,339 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 1 times [2022-04-08 14:59:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:46,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [428568952] [2022-04-08 14:59:46,339 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 2 times [2022-04-08 14:59:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:46,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051453452] [2022-04-08 14:59:46,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:46,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:46,369 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-08 14:59:46,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-08 14:59:46,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-08 14:59:46,370 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-08 14:59:46,371 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-08 14:59:46,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {572966#true} call #t~ret15 := main(); {572966#true} is VALID [2022-04-08 14:59:46,371 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-08 14:59:46,371 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-08 14:59:46,371 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-08 14:59:46,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {572966#true} assume !(0 != ~p1~0); {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {572966#true} assume !(0 != ~p2~0); {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {572966#true} assume !(0 != ~p3~0); {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {572966#true} assume !(0 != ~p4~0); {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {572966#true} assume !(0 != ~p5~0); {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {572966#true} assume !(0 != ~p6~0); {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {572966#true} assume !(0 != ~p7~0); {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {572966#true} assume !(0 != ~p8~0); {572966#true} is VALID [2022-04-08 14:59:46,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {572966#true} assume !(0 != ~p9~0); {572966#true} is VALID [2022-04-08 14:59:46,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {572966#true} assume !(0 != ~p10~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p1~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p2~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p3~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p4~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p5~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p6~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p7~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p8~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {572971#(= main_~p10~0 0)} assume !(0 != ~p9~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 14:59:46,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {572971#(= main_~p10~0 0)} assume 0 != ~p10~0; {572967#false} is VALID [2022-04-08 14:59:46,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {572967#false} assume 1 != ~lk10~0; {572967#false} is VALID [2022-04-08 14:59:46,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {572967#false} assume !false; {572967#false} is VALID [2022-04-08 14:59:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:59:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:46,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051453452] [2022-04-08 14:59:46,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051453452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:46,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:46,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:46,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:46,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [428568952] [2022-04-08 14:59:46,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [428568952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:46,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:46,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:46,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534192699] [2022-04-08 14:59:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:46,376 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-08 14:59:46,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:46,377 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-08 14:59:46,391 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-08 14:59:46,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:46,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:46,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:46,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:46,392 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-08 15:03:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:03:29,611 INFO L93 Difference]: Finished difference Result 42251 states and 48392 transitions. [2022-04-08 15:03:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:03:29,611 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-08 15:03:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:03:29,612 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-08 15:03:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-08 15:03:29,612 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-08 15:03:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-08 15:03:29,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-08 15:03:29,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:03:39,258 INFO L225 Difference]: With dead ends: 42251 [2022-04-08 15:03:39,258 INFO L226 Difference]: Without dead ends: 14601 [2022-04-08 15:03:39,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:03:39,286 INFO L913 BasicCegarLoop]: 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-08 15:03:39,286 INFO L914 BasicCegarLoop]: 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-08 15:03:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2022-04-08 15:03:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14601. [2022-04-08 15:03:40,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:03:40,418 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-08 15:03:40,435 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-08 15:03:40,451 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-08 15:03:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:03:46,080 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-08 15:03:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-08 15:03:46,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:03:46,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:03:46,107 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-08 15:03:46,124 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-08 15:03:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:03:51,348 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-08 15:03:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-08 15:03:51,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:03:51,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:03:51,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:03:51,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:03:51,375 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-08 15:04:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16135 transitions. [2022-04-08 15:04:00,938 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16135 transitions. Word has length 30 [2022-04-08 15:04:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:04:00,938 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 16135 transitions. [2022-04-08 15:04:00,938 INFO L479 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-08 15:04:00,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 16135 transitions. [2022-04-08 15:04:17,187 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-08 15:04:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-08 15:04:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 15:04:17,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:04:17,197 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:04:17,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 15:04:17,197 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:04:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:04:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 1 times [2022-04-08 15:04:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:04:17,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049453730] [2022-04-08 15:04:17,197 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:04:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 2 times [2022-04-08 15:04:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:04:17,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430369905] [2022-04-08 15:04:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:04:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:04:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:04:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:04:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:04:17,236 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-08 15:04:17,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-08 15:04:17,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-08 15:04:17,237 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-08 15:04:17,237 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-08 15:04:17,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-08 15:04:17,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-08 15:04:17,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {715884#true} call #t~ret15 := main(); {715884#true} is VALID [2022-04-08 15:04:17,237 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-08 15:04:17,237 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-08 15:04:17,237 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-08 15:04:17,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {715884#true} assume !(0 != ~p1~0); {715884#true} is VALID [2022-04-08 15:04:17,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {715884#true} assume !(0 != ~p2~0); {715884#true} is VALID [2022-04-08 15:04:17,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {715884#true} assume !(0 != ~p3~0); {715884#true} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {715884#true} assume !(0 != ~p4~0); {715884#true} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {715884#true} assume !(0 != ~p5~0); {715884#true} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {715884#true} assume !(0 != ~p6~0); {715884#true} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {715884#true} assume !(0 != ~p7~0); {715884#true} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {715884#true} assume !(0 != ~p8~0); {715884#true} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {715884#true} assume !(0 != ~p9~0); {715884#true} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {715884#true} assume 0 != ~p10~0;~lk10~0 := 1; {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {715889#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {715889#(= main_~lk10~0 1)} assume 0 != ~p10~0; {715889#(= main_~lk10~0 1)} is VALID [2022-04-08 15:04:17,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {715889#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {715885#false} is VALID [2022-04-08 15:04:17,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {715885#false} assume !false; {715885#false} is VALID [2022-04-08 15:04:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:04:17,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:04:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430369905] [2022-04-08 15:04:17,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430369905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:04:17,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:04:17,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:04:17,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:04:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049453730] [2022-04-08 15:04:17,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049453730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:04:17,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:04:17,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:04:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462950840] [2022-04-08 15:04:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:04:17,242 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-08 15:04:17,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:04:17,243 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-08 15:04:17,256 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-08 15:04:17,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:04:17,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:04:17,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:04:17,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:04:17,258 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-08 15:04:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:04:27,957 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-08 15:04:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:04:27,957 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-08 15:04:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:04:27,957 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-08 15:04:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-08 15:04:27,957 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-08 15:04:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-08 15:04:27,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-08 15:04:27,993 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-08 15:04:27,993 INFO L225 Difference]: With dead ends: 14601 [2022-04-08 15:04:27,993 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 15:04:28,007 INFO L912 BasicCegarLoop]: 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-08 15:04:28,008 INFO L913 BasicCegarLoop]: 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-08 15:04:28,008 INFO L914 BasicCegarLoop]: 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-08 15:04:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 15:04:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 15:04:28,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:04:28,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 15:04:28,009 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 15:04:28,009 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 15:04:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:04:28,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 15:04:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 15:04:28,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:04:28,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:04:28,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 15:04:28,009 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 15:04:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:04:28,010 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 15:04:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 15:04:28,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:04:28,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:04:28,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:04:28,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:04:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 15:04:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 15:04:28,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-08 15:04:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:04:28,010 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 15:04:28,010 INFO L479 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-08 15:04:28,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 15:04:28,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:04:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 15:04:28,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:04:28,013 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 15:04:28,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 15:04:28,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 15:04:56,466 WARN L232 SmtUtils]: Spent 28.41s 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-08 15:05:57,924 WARN L232 SmtUtils]: Spent 1.02m 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-08 15:08:07,642 WARN L232 SmtUtils]: Spent 2.16m 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-08 15:08:14,830 WARN L232 SmtUtils]: Spent 7.18s 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)