/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:17:26,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:17:26,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:17:26,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:17:26,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:17:26,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:17:26,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:17:26,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:17:26,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:17:26,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:17:26,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:17:26,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:17:26,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:17:26,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:17:26,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:17:26,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:17:26,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:17:26,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:17:26,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:17:26,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:17:26,254 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:17:26,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:17:26,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:17:26,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:17:26,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:17:26,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:17:26,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:17:26,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:17:26,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:17:26,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:17:26,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:17:26,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:17:26,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:17:26,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:17:26,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:17:26,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:17:26,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:17:26,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:17:26,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:17:26,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:17:26,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:17:26,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:17:26,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:17:26,284 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:17:26,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:17:26,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:17:26,285 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:17:26,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:17:26,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:17:26,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:17:26,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:17:26,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:17:26,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:17:26,286 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:17:26,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:17:26,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:26,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:17:26,287 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:17:26,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:17:26,288 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:17:26,288 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 08:17:26,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:17:26,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:17:26,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:17:26,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:17:26,502 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:17:26,502 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 08:17:26,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ddbc1c2/b7112302ddb54970ae814c071c633781/FLAG3bda5ffde [2022-04-08 08:17:26,868 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:17:26,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-08 08:17:26,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ddbc1c2/b7112302ddb54970ae814c071c633781/FLAG3bda5ffde [2022-04-08 08:17:27,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ddbc1c2/b7112302ddb54970ae814c071c633781 [2022-04-08 08:17:27,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:17:27,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:17:27,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:27,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:17:27,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:17:27,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea79b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27, skipping insertion in model container [2022-04-08 08:17:27,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:17:27,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:17:27,466 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 08:17:27,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:27,478 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:17:27,494 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 08:17:27,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:27,503 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:17:27,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27 WrapperNode [2022-04-08 08:17:27,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:27,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:17:27,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:17:27,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:17:27,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:17:27,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:17:27,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:17:27,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:17:27,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (1/1) ... [2022-04-08 08:17:27,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:27,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:27,564 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 08:17:27,566 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 08:17:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:17:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:17:27,587 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:17:27,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:17:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:17:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:17:27,663 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:17:27,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:17:27,840 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:17:27,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:17:27,845 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:17:27,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:27 BoogieIcfgContainer [2022-04-08 08:17:27,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:17:27,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:17:27,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:17:27,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:17:27,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:17:27" (1/3) ... [2022-04-08 08:17:27,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d803b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:27, skipping insertion in model container [2022-04-08 08:17:27,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:27" (2/3) ... [2022-04-08 08:17:27,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d803b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:27, skipping insertion in model container [2022-04-08 08:17:27,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:27" (3/3) ... [2022-04-08 08:17:27,859 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2022-04-08 08:17:27,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:17:27,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:17:27,902 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:17:27,907 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 08:17:27,908 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:17:27,927 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 08:17:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:17:27,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:27,935 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 08:17:27,935 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 1 times [2022-04-08 08:17:27,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:27,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [398501952] [2022-04-08 08:17:27,953 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 2 times [2022-04-08 08:17:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:27,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442552762] [2022-04-08 08:17:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:28,181 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 08:17:28,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-08 08:17:28,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-08 08:17:28,183 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 08:17:28,183 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 08:17:28,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-08 08:17:28,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-08 08:17:28,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret15 := main(); {48#true} is VALID [2022-04-08 08:17:28,185 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 08:17:28,185 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 08:17:28,185 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 08:17:28,186 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 08:17:28,186 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 08:17:28,187 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 08:17:28,187 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 08:17:28,188 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 08:17:28,188 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 08:17:28,189 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 08:17:28,189 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 08:17:28,190 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 08:17:28,193 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 08:17:28,194 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 08:17:28,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {49#false} is VALID [2022-04-08 08:17:28,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} assume !false; {49#false} is VALID [2022-04-08 08:17:28,196 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 08:17:28,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:28,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442552762] [2022-04-08 08:17:28,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442552762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:28,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:28,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:28,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:28,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [398501952] [2022-04-08 08:17:28,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [398501952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:28,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:28,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:28,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120948109] [2022-04-08 08:17:28,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:28,203 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 08:17:28,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:28,206 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 08:17:28,233 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 08:17:28,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:28,255 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 08:17:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:28,573 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-04-08 08:17:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:28,573 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 08:17:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:28,574 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 08:17:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 08:17:28,581 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 08:17:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 08:17:28,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 08:17:28,705 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 08:17:28,712 INFO L225 Difference]: With dead ends: 88 [2022-04-08 08:17:28,712 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 08:17:28,714 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 08:17:28,716 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 08:17:28,717 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 08:17:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 08:17:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-08 08:17:28,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:28,741 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 08:17:28,741 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 08:17:28,742 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 08:17:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:28,746 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-08 08:17:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-08 08:17:28,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:28,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:28,747 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 08:17:28,747 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 08:17:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:28,751 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-08 08:17:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-08 08:17:28,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:28,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:28,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:28,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:28,753 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 08:17:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-08 08:17:28,755 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-08 08:17:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:28,756 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-08 08:17:28,756 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 08:17:28,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 90 transitions. [2022-04-08 08:17:28,827 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 08:17:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-08 08:17:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:17:28,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:28,828 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 08:17:28,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:17:28,828 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 1 times [2022-04-08 08:17:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:28,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971712861] [2022-04-08 08:17:28,830 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 2 times [2022-04-08 08:17:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:28,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569778683] [2022-04-08 08:17:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:28,876 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 08:17:28,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-08 08:17:28,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-08 08:17:28,877 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 08:17:28,877 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 08:17:28,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-08 08:17:28,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} #200#return; {484#true} is VALID [2022-04-08 08:17:28,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} call #t~ret15 := main(); {484#true} is VALID [2022-04-08 08:17:28,878 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 08:17:28,878 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 08:17:28,878 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 08:17:28,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#true} assume !(0 != ~p1~0); {489#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:28,879 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 08:17:28,879 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 08:17:28,879 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 08:17:28,880 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 08:17:28,880 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 08:17:28,881 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 08:17:28,881 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 08:17:28,881 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 08:17:28,882 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 08:17:28,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#(= main_~p1~0 0)} assume 0 != ~p1~0; {485#false} is VALID [2022-04-08 08:17:28,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#false} assume 1 != ~lk1~0; {485#false} is VALID [2022-04-08 08:17:28,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#false} assume !false; {485#false} is VALID [2022-04-08 08:17:28,882 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 08:17:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569778683] [2022-04-08 08:17:28,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569778683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:28,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:28,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:28,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971712861] [2022-04-08 08:17:28,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971712861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:28,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:28,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135195658] [2022-04-08 08:17:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:28,885 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 08:17:28,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:28,885 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 08:17:28,898 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 08:17:28,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:28,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:28,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:28,899 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 08:17:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:29,121 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-04-08 08:17:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:29,121 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 08:17:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:29,122 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 08:17:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-08 08:17:29,124 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 08:17:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-08 08:17:29,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-08 08:17:29,257 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 08:17:29,258 INFO L225 Difference]: With dead ends: 118 [2022-04-08 08:17:29,259 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 08:17:29,259 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 08:17:29,260 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 08:17:29,260 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 08:17:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 08:17:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-08 08:17:29,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:29,268 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 08:17:29,268 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 08:17:29,269 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 08:17:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:29,273 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-08 08:17:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-08 08:17:29,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:29,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:29,277 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 08:17:29,277 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 08:17:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:29,279 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-08 08:17:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-08 08:17:29,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:29,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:29,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:29,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:29,280 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 08:17:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-08 08:17:29,285 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-08 08:17:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:29,285 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-08 08:17:29,285 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 08:17:29,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 126 transitions. [2022-04-08 08:17:29,388 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 08:17:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-08 08:17:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:17:29,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:29,389 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 08:17:29,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:17:29,389 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 1 times [2022-04-08 08:17:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:29,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [308848742] [2022-04-08 08:17:29,390 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 2 times [2022-04-08 08:17:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:29,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161463167] [2022-04-08 08:17:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:29,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:29,432 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 08:17:29,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-08 08:17:29,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-08 08:17:29,433 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 08:17:29,433 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 08:17:29,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1020#true} assume true; {1020#true} is VALID [2022-04-08 08:17:29,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1020#true} {1020#true} #200#return; {1020#true} is VALID [2022-04-08 08:17:29,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {1020#true} call #t~ret15 := main(); {1020#true} is VALID [2022-04-08 08:17:29,434 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 08:17:29,434 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 08:17:29,434 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 08:17:29,434 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 08:17:29,435 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 08:17:29,435 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 08:17:29,435 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 08:17:29,435 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 08:17:29,436 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 08:17:29,436 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 08:17:29,436 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 08:17:29,437 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 08:17:29,437 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 08:17:29,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1021#false} is VALID [2022-04-08 08:17:29,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {1021#false} assume 0 != ~p2~0; {1021#false} is VALID [2022-04-08 08:17:29,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {1021#false} assume 1 != ~lk2~0; {1021#false} is VALID [2022-04-08 08:17:29,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2022-04-08 08:17:29,438 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 08:17:29,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:29,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161463167] [2022-04-08 08:17:29,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161463167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:29,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:29,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:29,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:29,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [308848742] [2022-04-08 08:17:29,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [308848742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:29,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:29,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957126554] [2022-04-08 08:17:29,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:29,439 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 08:17:29,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:29,440 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 08:17:29,451 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 08:17:29,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:29,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:29,452 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 08:17:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:29,595 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-04-08 08:17:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:29,596 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 08:17:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:29,596 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 08:17:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 08:17:29,598 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 08:17:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 08:17:29,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-08 08:17:29,739 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 08:17:29,741 INFO L225 Difference]: With dead ends: 109 [2022-04-08 08:17:29,741 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 08:17:29,741 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 08:17:29,742 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 08:17:29,742 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 08:17:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 08:17:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-08 08:17:29,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:29,749 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 08:17:29,750 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 08:17:29,750 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 08:17:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:29,752 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-08 08:17:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-08 08:17:29,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:29,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:29,752 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 08:17:29,753 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 08:17:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:29,754 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-08 08:17:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-08 08:17:29,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:29,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:29,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:29,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:29,755 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 08:17:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-08 08:17:29,757 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-08 08:17:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:29,757 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-08 08:17:29,757 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 08:17:29,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 128 transitions. [2022-04-08 08:17:29,851 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 08:17:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-08 08:17:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:17:29,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:29,852 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 08:17:29,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:17:29,852 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 1 times [2022-04-08 08:17:29,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:29,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612009044] [2022-04-08 08:17:29,853 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 2 times [2022-04-08 08:17:29,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:29,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71527533] [2022-04-08 08:17:29,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:29,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:29,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:29,905 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 08:17:29,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-08 08:17:29,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-08 08:17:29,908 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 08:17:29,909 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 08:17:29,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-08 08:17:29,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #200#return; {1550#true} is VALID [2022-04-08 08:17:29,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret15 := main(); {1550#true} is VALID [2022-04-08 08:17:29,909 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 08:17:29,909 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 08:17:29,909 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 08:17:29,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#true} assume !(0 != ~p1~0); {1550#true} is VALID [2022-04-08 08:17:29,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#true} assume !(0 != ~p2~0); {1555#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:29,914 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 08:17:29,916 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 08:17:29,916 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 08:17:29,916 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 08:17:29,917 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 08:17:29,917 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 08:17:29,919 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 08:17:29,919 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 08:17:29,919 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 08:17:29,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {1555#(= main_~p2~0 0)} assume 0 != ~p2~0; {1551#false} is VALID [2022-04-08 08:17:29,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {1551#false} assume 1 != ~lk2~0; {1551#false} is VALID [2022-04-08 08:17:29,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-08 08:17:29,920 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 08:17:29,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:29,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71527533] [2022-04-08 08:17:29,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71527533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:29,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:29,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:29,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:29,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612009044] [2022-04-08 08:17:29,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612009044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:29,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:29,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19305087] [2022-04-08 08:17:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:29,921 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 08:17:29,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:29,922 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 08:17:29,935 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 08:17:29,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:29,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:29,936 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 08:17:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:30,074 INFO L93 Difference]: Finished difference Result 202 states and 360 transitions. [2022-04-08 08:17:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:30,074 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 08:17:30,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:30,075 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 08:17:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-08 08:17:30,077 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 08:17:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-08 08:17:30,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-08 08:17:30,211 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 08:17:30,214 INFO L225 Difference]: With dead ends: 202 [2022-04-08 08:17:30,214 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 08:17:30,215 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 08:17:30,215 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 08:17:30,216 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 08:17:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 08:17:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-08 08:17:30,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:30,226 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 08:17:30,226 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 08:17:30,227 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 08:17:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:30,230 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-08 08:17:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-08 08:17:30,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:30,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:30,231 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 08:17:30,231 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 08:17:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:30,235 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-08 08:17:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-08 08:17:30,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:30,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:30,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:30,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:30,235 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 08:17:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 237 transitions. [2022-04-08 08:17:30,239 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 237 transitions. Word has length 22 [2022-04-08 08:17:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:30,239 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 237 transitions. [2022-04-08 08:17:30,239 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 08:17:30,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 237 transitions. [2022-04-08 08:17:30,448 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 08:17:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2022-04-08 08:17:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:17:30,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:30,449 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 08:17:30,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:17:30,450 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:30,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:30,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 1 times [2022-04-08 08:17:30,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:30,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201477766] [2022-04-08 08:17:30,454 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 2 times [2022-04-08 08:17:30,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:30,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832794591] [2022-04-08 08:17:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:30,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:30,503 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 08:17:30,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-08 08:17:30,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-08 08:17:30,504 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 08:17:30,504 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 08:17:30,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#true} assume true; {2510#true} is VALID [2022-04-08 08:17:30,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2510#true} {2510#true} #200#return; {2510#true} is VALID [2022-04-08 08:17:30,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#true} call #t~ret15 := main(); {2510#true} is VALID [2022-04-08 08:17:30,505 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 08:17:30,505 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 08:17:30,505 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 08:17:30,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {2510#true} assume !(0 != ~p1~0); {2510#true} is VALID [2022-04-08 08:17:30,505 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 08:17:30,506 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 08:17:30,506 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 08:17:30,506 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 08:17:30,507 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 08:17:30,507 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 08:17:30,507 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 08:17:30,508 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 08:17:30,508 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 08:17:30,508 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 08:17:30,508 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 08:17:30,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {2515#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2511#false} is VALID [2022-04-08 08:17:30,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {2511#false} assume !false; {2511#false} is VALID [2022-04-08 08:17:30,509 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 08:17:30,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:30,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832794591] [2022-04-08 08:17:30,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832794591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:30,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:30,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:30,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:30,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201477766] [2022-04-08 08:17:30,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201477766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:30,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:30,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205253595] [2022-04-08 08:17:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:30,510 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 08:17:30,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:30,511 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 08:17:30,521 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 08:17:30,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:30,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:30,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:30,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:30,522 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 08:17:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:30,679 INFO L93 Difference]: Finished difference Result 175 states and 307 transitions. [2022-04-08 08:17:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:30,679 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 08:17:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:30,679 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 08:17:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-08 08:17:30,681 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 08:17:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-08 08:17:30,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-08 08:17:30,773 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 08:17:30,776 INFO L225 Difference]: With dead ends: 175 [2022-04-08 08:17:30,776 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 08:17:30,777 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 08:17:30,777 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 08:17:30,777 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 08:17:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 08:17:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2022-04-08 08:17:30,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:30,794 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 08:17:30,794 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 08:17:30,795 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 08:17:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:30,802 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-08 08:17:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-08 08:17:30,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:30,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:30,803 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 08:17:30,803 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 08:17:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:30,807 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-08 08:17:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-08 08:17:30,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:30,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:30,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:30,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:30,808 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 08:17:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-08 08:17:30,811 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-08 08:17:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:30,813 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-08 08:17:30,813 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 08:17:30,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 235 transitions. [2022-04-08 08:17:30,996 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 08:17:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-08 08:17:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:17:30,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:30,997 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 08:17:30,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:17:30,997 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 1 times [2022-04-08 08:17:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:30,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699007153] [2022-04-08 08:17:30,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 2 times [2022-04-08 08:17:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:30,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470906469] [2022-04-08 08:17:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:31,033 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 08:17:31,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-08 08:17:31,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-08 08:17:31,036 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 08:17:31,036 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 08:17:31,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {3488#true} assume true; {3488#true} is VALID [2022-04-08 08:17:31,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3488#true} {3488#true} #200#return; {3488#true} is VALID [2022-04-08 08:17:31,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {3488#true} call #t~ret15 := main(); {3488#true} is VALID [2022-04-08 08:17:31,036 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 08:17:31,037 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 08:17:31,037 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 08:17:31,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {3488#true} assume !(0 != ~p1~0); {3488#true} is VALID [2022-04-08 08:17:31,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {3488#true} assume !(0 != ~p2~0); {3488#true} is VALID [2022-04-08 08:17:31,038 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 08:17:31,039 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 08:17:31,039 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 08:17:31,039 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 08:17:31,039 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 08:17:31,040 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 08:17:31,040 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 08:17:31,040 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 08:17:31,040 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 08:17:31,041 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 08:17:31,041 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 08:17:31,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {3493#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3489#false} is VALID [2022-04-08 08:17:31,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {3489#false} assume !false; {3489#false} is VALID [2022-04-08 08:17:31,041 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 08:17:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:31,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470906469] [2022-04-08 08:17:31,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470906469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:31,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:31,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:31,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:31,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699007153] [2022-04-08 08:17:31,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699007153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:31,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:31,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515633536] [2022-04-08 08:17:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:31,043 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 08:17:31,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:31,043 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 08:17:31,054 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 08:17:31,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:31,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:31,055 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 08:17:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:31,193 INFO L93 Difference]: Finished difference Result 251 states and 443 transitions. [2022-04-08 08:17:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:31,193 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 08:17:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:31,193 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 08:17:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 08:17:31,195 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 08:17:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 08:17:31,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 08:17:31,272 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 08:17:31,275 INFO L225 Difference]: With dead ends: 251 [2022-04-08 08:17:31,275 INFO L226 Difference]: Without dead ends: 249 [2022-04-08 08:17:31,276 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 08:17:31,276 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 08:17:31,276 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 08:17:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-08 08:17:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2022-04-08 08:17:31,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:31,301 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 08:17:31,302 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 08:17:31,302 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 08:17:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:31,308 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-08 08:17:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-08 08:17:31,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:31,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:31,308 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 08:17:31,309 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 08:17:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:31,314 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-08 08:17:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-08 08:17:31,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:31,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:31,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:31,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:31,315 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 08:17:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 317 transitions. [2022-04-08 08:17:31,320 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 317 transitions. Word has length 23 [2022-04-08 08:17:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:31,320 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 317 transitions. [2022-04-08 08:17:31,320 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 08:17:31,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 317 transitions. [2022-04-08 08:17:31,579 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 08:17:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 317 transitions. [2022-04-08 08:17:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:17:31,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:31,580 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 08:17:31,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:17:31,580 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 1 times [2022-04-08 08:17:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:31,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433977085] [2022-04-08 08:17:31,581 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:31,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 2 times [2022-04-08 08:17:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:31,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980792130] [2022-04-08 08:17:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:31,632 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 08:17:31,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-08 08:17:31,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-08 08:17:31,633 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 08:17:31,633 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 08:17:31,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-04-08 08:17:31,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4866#true} {4866#true} #200#return; {4866#true} is VALID [2022-04-08 08:17:31,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {4866#true} call #t~ret15 := main(); {4866#true} is VALID [2022-04-08 08:17:31,633 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 08:17:31,633 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 08:17:31,633 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 08:17:31,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#true} assume !(0 != ~p1~0); {4866#true} is VALID [2022-04-08 08:17:31,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#true} assume !(0 != ~p2~0); {4866#true} is VALID [2022-04-08 08:17:31,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {4866#true} assume !(0 != ~p3~0); {4871#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:31,634 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 08:17:31,635 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 08:17:31,635 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 08:17:31,635 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 08:17:31,636 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 08:17:31,636 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 08:17:31,636 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 08:17:31,637 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 08:17:31,637 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 08:17:31,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#(= main_~p3~0 0)} assume 0 != ~p3~0; {4867#false} is VALID [2022-04-08 08:17:31,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {4867#false} assume 1 != ~lk3~0; {4867#false} is VALID [2022-04-08 08:17:31,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {4867#false} assume !false; {4867#false} is VALID [2022-04-08 08:17:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:31,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980792130] [2022-04-08 08:17:31,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980792130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:31,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:31,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:31,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:31,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433977085] [2022-04-08 08:17:31,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433977085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:31,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:31,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856940846] [2022-04-08 08:17:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:31,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:17:31,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:31,640 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 08:17:31,655 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 08:17:31,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:31,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:31,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:31,656 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 08:17:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:31,824 INFO L93 Difference]: Finished difference Result 431 states and 755 transitions. [2022-04-08 08:17:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:31,825 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 08:17:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:31,825 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 08:17:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-08 08:17:31,827 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 08:17:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-08 08:17:31,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-08 08:17:31,937 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 08:17:31,940 INFO L225 Difference]: With dead ends: 431 [2022-04-08 08:17:31,940 INFO L226 Difference]: Without dead ends: 257 [2022-04-08 08:17:31,941 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 08:17:31,942 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 08:17:31,942 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 08:17:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-08 08:17:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2022-04-08 08:17:31,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:31,957 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 08:17:31,958 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 08:17:31,958 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 08:17:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:31,963 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-08 08:17:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-08 08:17:31,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:31,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:31,964 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 08:17:31,965 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 08:17:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:31,970 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-08 08:17:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-08 08:17:31,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:31,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:31,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:31,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:31,971 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 08:17:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 439 transitions. [2022-04-08 08:17:31,975 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 439 transitions. Word has length 23 [2022-04-08 08:17:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:31,975 INFO L478 AbstractCegarLoop]: Abstraction has 255 states and 439 transitions. [2022-04-08 08:17:31,975 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 08:17:31,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 255 states and 439 transitions. [2022-04-08 08:17:32,350 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 08:17:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 439 transitions. [2022-04-08 08:17:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:32,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:32,351 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 08:17:32,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:17:32,351 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:32,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 1 times [2022-04-08 08:17:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:32,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176257540] [2022-04-08 08:17:32,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 2 times [2022-04-08 08:17:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:32,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287585250] [2022-04-08 08:17:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:32,390 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 08:17:32,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-08 08:17:32,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-08 08:17:32,391 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 08:17:32,391 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 08:17:32,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {6764#true} assume true; {6764#true} is VALID [2022-04-08 08:17:32,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6764#true} {6764#true} #200#return; {6764#true} is VALID [2022-04-08 08:17:32,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {6764#true} call #t~ret15 := main(); {6764#true} is VALID [2022-04-08 08:17:32,391 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 08:17:32,392 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 08:17:32,392 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 08:17:32,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {6764#true} assume !(0 != ~p1~0); {6764#true} is VALID [2022-04-08 08:17:32,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {6764#true} assume !(0 != ~p2~0); {6764#true} is VALID [2022-04-08 08:17:32,392 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 08:17:32,392 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 08:17:32,393 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 08:17:32,393 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 08:17:32,393 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 08:17:32,393 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 08:17:32,394 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 08:17:32,394 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 08:17:32,394 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 08:17:32,394 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 08:17:32,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {6769#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6765#false} is VALID [2022-04-08 08:17:32,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {6765#false} assume 0 != ~p4~0; {6765#false} is VALID [2022-04-08 08:17:32,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {6765#false} assume 1 != ~lk4~0; {6765#false} is VALID [2022-04-08 08:17:32,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {6765#false} assume !false; {6765#false} is VALID [2022-04-08 08:17:32,395 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 08:17:32,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:32,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287585250] [2022-04-08 08:17:32,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287585250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:32,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:32,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:32,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:32,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176257540] [2022-04-08 08:17:32,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176257540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:32,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:32,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977652251] [2022-04-08 08:17:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:32,396 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 08:17:32,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:32,396 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 08:17:32,408 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 08:17:32,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:32,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:32,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:32,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:32,409 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 08:17:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:32,602 INFO L93 Difference]: Finished difference Result 385 states and 661 transitions. [2022-04-08 08:17:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:32,602 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 08:17:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:32,603 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 08:17:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-08 08:17:32,615 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 08:17:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-08 08:17:32,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-08 08:17:32,719 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 08:17:32,730 INFO L225 Difference]: With dead ends: 385 [2022-04-08 08:17:32,730 INFO L226 Difference]: Without dead ends: 263 [2022-04-08 08:17:32,731 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 08:17:32,732 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 08:17:32,732 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 08:17:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-08 08:17:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-08 08:17:32,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:32,745 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 08:17:32,746 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 08:17:32,753 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 08:17:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:32,758 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-08 08:17:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-08 08:17:32,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:32,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:32,759 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 08:17:32,759 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 08:17:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:32,764 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-08 08:17:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-08 08:17:32,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:32,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:32,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:32,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:32,765 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 08:17:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 443 transitions. [2022-04-08 08:17:32,773 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 443 transitions. Word has length 24 [2022-04-08 08:17:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:32,773 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 443 transitions. [2022-04-08 08:17:32,773 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 08:17:32,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 443 transitions. [2022-04-08 08:17:33,122 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 08:17:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 443 transitions. [2022-04-08 08:17:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:33,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:33,123 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 08:17:33,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:17:33,123 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:33,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 1 times [2022-04-08 08:17:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [658449655] [2022-04-08 08:17:33,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 2 times [2022-04-08 08:17:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:33,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810922792] [2022-04-08 08:17:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:33,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:33,177 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 08:17:33,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-08 08:17:33,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-08 08:17:33,178 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 08:17:33,178 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 08:17:33,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {8594#true} assume true; {8594#true} is VALID [2022-04-08 08:17:33,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8594#true} {8594#true} #200#return; {8594#true} is VALID [2022-04-08 08:17:33,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {8594#true} call #t~ret15 := main(); {8594#true} is VALID [2022-04-08 08:17:33,178 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 08:17:33,178 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 08:17:33,178 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 08:17:33,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#true} assume !(0 != ~p1~0); {8594#true} is VALID [2022-04-08 08:17:33,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#true} assume !(0 != ~p2~0); {8594#true} is VALID [2022-04-08 08:17:33,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#true} assume !(0 != ~p3~0); {8594#true} is VALID [2022-04-08 08:17:33,179 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 08:17:33,179 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 08:17:33,179 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 08:17:33,180 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 08:17:33,180 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 08:17:33,180 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 08:17:33,180 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 08:17:33,181 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 08:17:33,181 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 08:17:33,181 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 08:17:33,181 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 08:17:33,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {8599#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {8595#false} is VALID [2022-04-08 08:17:33,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {8595#false} assume !false; {8595#false} is VALID [2022-04-08 08:17:33,182 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 08:17:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:33,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810922792] [2022-04-08 08:17:33,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810922792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:33,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:33,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:33,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:33,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [658449655] [2022-04-08 08:17:33,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [658449655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:33,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:33,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107532088] [2022-04-08 08:17:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:33,183 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 08:17:33,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:33,183 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 08:17:33,194 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 08:17:33,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:33,195 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 08:17:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:33,340 INFO L93 Difference]: Finished difference Result 477 states and 821 transitions. [2022-04-08 08:17:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:33,340 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 08:17:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:33,341 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 08:17:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 08:17:33,342 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 08:17:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 08:17:33,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-08 08:17:33,425 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 08:17:33,434 INFO L225 Difference]: With dead ends: 477 [2022-04-08 08:17:33,434 INFO L226 Difference]: Without dead ends: 475 [2022-04-08 08:17:33,435 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 08:17:33,435 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 08:17:33,435 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 08:17:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-08 08:17:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-08 08:17:33,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:33,454 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 08:17:33,454 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 08:17:33,455 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 08:17:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:33,464 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-08 08:17:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-08 08:17:33,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:33,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:33,466 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 08:17:33,466 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 08:17:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:33,476 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-08 08:17:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-08 08:17:33,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:33,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:33,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:33,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:33,477 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 08:17:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2022-04-08 08:17:33,485 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 24 [2022-04-08 08:17:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:33,485 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2022-04-08 08:17:33,485 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 08:17:33,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 603 transitions. [2022-04-08 08:17:33,997 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 08:17:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2022-04-08 08:17:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:33,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:33,998 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 08:17:33,998 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:17:33,998 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 1 times [2022-04-08 08:17:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209822331] [2022-04-08 08:17:33,999 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 2 times [2022-04-08 08:17:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:33,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030817880] [2022-04-08 08:17:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:34,026 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 08:17:34,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-08 08:17:34,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-08 08:17:34,026 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 08:17:34,026 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 08:17:34,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {11232#true} assume true; {11232#true} is VALID [2022-04-08 08:17:34,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11232#true} {11232#true} #200#return; {11232#true} is VALID [2022-04-08 08:17:34,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {11232#true} call #t~ret15 := main(); {11232#true} is VALID [2022-04-08 08:17:34,027 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 08:17:34,027 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 08:17:34,027 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 08:17:34,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {11232#true} assume !(0 != ~p1~0); {11232#true} is VALID [2022-04-08 08:17:34,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {11232#true} assume !(0 != ~p2~0); {11232#true} is VALID [2022-04-08 08:17:34,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {11232#true} assume !(0 != ~p3~0); {11232#true} is VALID [2022-04-08 08:17:34,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {11232#true} assume !(0 != ~p4~0); {11237#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:34,028 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 08:17:34,028 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 08:17:34,028 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 08:17:34,028 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 08:17:34,029 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 08:17:34,029 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 08:17:34,029 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 08:17:34,029 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 08:17:34,030 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 08:17:34,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {11237#(= main_~p4~0 0)} assume 0 != ~p4~0; {11233#false} is VALID [2022-04-08 08:17:34,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {11233#false} assume 1 != ~lk4~0; {11233#false} is VALID [2022-04-08 08:17:34,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {11233#false} assume !false; {11233#false} is VALID [2022-04-08 08:17:34,030 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 08:17:34,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:34,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030817880] [2022-04-08 08:17:34,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030817880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:34,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:34,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:34,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:34,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209822331] [2022-04-08 08:17:34,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209822331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:34,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:34,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:34,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37650398] [2022-04-08 08:17:34,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:34,031 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 08:17:34,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:34,032 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 08:17:34,043 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 08:17:34,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:34,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:34,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:34,044 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 08:17:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,223 INFO L93 Difference]: Finished difference Result 845 states and 1421 transitions. [2022-04-08 08:17:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:34,224 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 08:17:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:34,224 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 08:17:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 08:17:34,226 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 08:17:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 08:17:34,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-08 08:17:34,331 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 08:17:34,341 INFO L225 Difference]: With dead ends: 845 [2022-04-08 08:17:34,341 INFO L226 Difference]: Without dead ends: 499 [2022-04-08 08:17:34,342 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 08:17:34,343 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 08:17:34,343 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 08:17:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-08 08:17:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-08 08:17:34,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:34,369 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 08:17:34,384 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 08:17:34,385 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 08:17:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,395 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-08 08:17:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-08 08:17:34,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:34,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:34,397 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 08:17:34,397 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 08:17:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,408 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-08 08:17:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-08 08:17:34,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:34,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:34,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:34,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:34,409 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 08:17:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 823 transitions. [2022-04-08 08:17:34,422 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 823 transitions. Word has length 24 [2022-04-08 08:17:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:34,422 INFO L478 AbstractCegarLoop]: Abstraction has 497 states and 823 transitions. [2022-04-08 08:17:34,422 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 08:17:34,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 497 states and 823 transitions. [2022-04-08 08:17:35,152 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 08:17:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 823 transitions. [2022-04-08 08:17:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:35,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:35,153 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 08:17:35,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:17:35,153 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 1 times [2022-04-08 08:17:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517919923] [2022-04-08 08:17:35,154 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 2 times [2022-04-08 08:17:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:35,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444533914] [2022-04-08 08:17:35,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,193 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 08:17:35,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-08 08:17:35,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-08 08:17:35,194 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 08:17:35,194 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 08:17:35,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {14926#true} assume true; {14926#true} is VALID [2022-04-08 08:17:35,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14926#true} {14926#true} #200#return; {14926#true} is VALID [2022-04-08 08:17:35,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {14926#true} call #t~ret15 := main(); {14926#true} is VALID [2022-04-08 08:17:35,195 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 08:17:35,195 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 08:17:35,195 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 08:17:35,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {14926#true} assume !(0 != ~p1~0); {14926#true} is VALID [2022-04-08 08:17:35,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {14926#true} assume !(0 != ~p2~0); {14926#true} is VALID [2022-04-08 08:17:35,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {14926#true} assume !(0 != ~p3~0); {14926#true} is VALID [2022-04-08 08:17:35,196 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 08:17:35,196 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 08:17:35,196 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 08:17:35,197 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 08:17:35,197 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 08:17:35,197 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 08:17:35,198 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 08:17:35,198 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 08:17:35,198 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 08:17:35,199 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 08:17:35,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {14931#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {14927#false} is VALID [2022-04-08 08:17:35,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {14927#false} assume 0 != ~p5~0; {14927#false} is VALID [2022-04-08 08:17:35,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {14927#false} assume 1 != ~lk5~0; {14927#false} is VALID [2022-04-08 08:17:35,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {14927#false} assume !false; {14927#false} is VALID [2022-04-08 08:17:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:35,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:35,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444533914] [2022-04-08 08:17:35,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444533914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:35,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517919923] [2022-04-08 08:17:35,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517919923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628863353] [2022-04-08 08:17:35,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:35,202 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 08:17:35,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:35,203 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 08:17:35,217 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 08:17:35,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:35,218 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 08:17:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,407 INFO L93 Difference]: Finished difference Result 745 states and 1229 transitions. [2022-04-08 08:17:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:35,408 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 08:17:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:35,408 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 08:17:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-08 08:17:35,410 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 08:17:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-08 08:17:35,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-08 08:17:35,526 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 08:17:35,536 INFO L225 Difference]: With dead ends: 745 [2022-04-08 08:17:35,536 INFO L226 Difference]: Without dead ends: 507 [2022-04-08 08:17:35,537 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 08:17:35,537 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 08:17:35,537 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 08:17:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-08 08:17:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-08 08:17:35,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:35,565 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 08:17:35,565 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 08:17:35,566 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 08:17:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,578 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-08 08:17:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-08 08:17:35,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:35,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:35,580 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 08:17:35,580 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 08:17:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,591 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-08 08:17:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-08 08:17:35,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:35,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:35,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:35,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:35,592 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 08:17:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2022-04-08 08:17:35,612 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 25 [2022-04-08 08:17:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:35,612 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2022-04-08 08:17:35,612 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 08:17:35,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 823 transitions. [2022-04-08 08:17:36,305 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 08:17:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2022-04-08 08:17:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:36,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:36,306 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 08:17:36,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:17:36,306 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:36,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:36,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 1 times [2022-04-08 08:17:36,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512566301] [2022-04-08 08:17:36,307 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 2 times [2022-04-08 08:17:36,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:36,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401488505] [2022-04-08 08:17:36,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:36,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:36,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:36,407 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 08:17:36,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-08 08:17:36,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-08 08:17:36,408 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 08:17:36,408 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 08:17:36,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {18452#true} assume true; {18452#true} is VALID [2022-04-08 08:17:36,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18452#true} {18452#true} #200#return; {18452#true} is VALID [2022-04-08 08:17:36,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {18452#true} call #t~ret15 := main(); {18452#true} is VALID [2022-04-08 08:17:36,408 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 08:17:36,408 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 08:17:36,408 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 08:17:36,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {18452#true} assume !(0 != ~p1~0); {18452#true} is VALID [2022-04-08 08:17:36,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {18452#true} assume !(0 != ~p2~0); {18452#true} is VALID [2022-04-08 08:17:36,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {18452#true} assume !(0 != ~p3~0); {18452#true} is VALID [2022-04-08 08:17:36,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {18452#true} assume !(0 != ~p4~0); {18452#true} is VALID [2022-04-08 08:17:36,409 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 08:17:36,409 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 08:17:36,410 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 08:17:36,410 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 08:17:36,410 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 08:17:36,410 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 08:17:36,410 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 08:17:36,411 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 08:17:36,411 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 08:17:36,411 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 08:17:36,411 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 08:17:36,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {18457#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {18453#false} is VALID [2022-04-08 08:17:36,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {18453#false} assume !false; {18453#false} is VALID [2022-04-08 08:17:36,412 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 08:17:36,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:36,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401488505] [2022-04-08 08:17:36,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401488505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:36,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:36,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:36,412 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:36,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512566301] [2022-04-08 08:17:36,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512566301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:36,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:36,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849820766] [2022-04-08 08:17:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:36,413 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 08:17:36,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:36,413 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 08:17:36,426 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 08:17:36,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:36,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:36,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:36,426 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 08:17:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,686 INFO L93 Difference]: Finished difference Result 909 states and 1505 transitions. [2022-04-08 08:17:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:36,686 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 08:17:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:36,686 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 08:17:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 08:17:36,687 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 08:17:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 08:17:36,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 08:17:36,755 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 08:17:36,786 INFO L225 Difference]: With dead ends: 909 [2022-04-08 08:17:36,786 INFO L226 Difference]: Without dead ends: 907 [2022-04-08 08:17:36,787 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 08:17:36,787 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 08:17:36,788 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 08:17:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-08 08:17:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-08 08:17:36,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:36,828 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 08:17:36,828 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 08:17:36,829 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 08:17:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,864 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-08 08:17:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-08 08:17:36,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,866 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 08:17:36,867 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 08:17:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,894 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-08 08:17:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-08 08:17:36,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:36,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:36,896 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 08:17:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1135 transitions. [2022-04-08 08:17:36,919 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1135 transitions. Word has length 25 [2022-04-08 08:17:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:36,919 INFO L478 AbstractCegarLoop]: Abstraction has 713 states and 1135 transitions. [2022-04-08 08:17:36,919 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 08:17:36,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 713 states and 1135 transitions. [2022-04-08 08:17:37,935 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 08:17:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1135 transitions. [2022-04-08 08:17:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:37,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:37,936 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 08:17:37,936 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:17:37,936 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:37,936 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 1 times [2022-04-08 08:17:37,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376658034] [2022-04-08 08:17:37,937 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 2 times [2022-04-08 08:17:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:37,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913874498] [2022-04-08 08:17:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,973 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 08:17:37,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-08 08:17:37,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-08 08:17:37,974 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 08:17:37,974 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 08:17:37,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {23522#true} assume true; {23522#true} is VALID [2022-04-08 08:17:37,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23522#true} {23522#true} #200#return; {23522#true} is VALID [2022-04-08 08:17:37,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {23522#true} call #t~ret15 := main(); {23522#true} is VALID [2022-04-08 08:17:37,974 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 08:17:37,975 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 08:17:37,975 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 08:17:37,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {23522#true} assume !(0 != ~p1~0); {23522#true} is VALID [2022-04-08 08:17:37,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {23522#true} assume !(0 != ~p2~0); {23522#true} is VALID [2022-04-08 08:17:37,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {23522#true} assume !(0 != ~p3~0); {23522#true} is VALID [2022-04-08 08:17:37,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {23522#true} assume !(0 != ~p4~0); {23522#true} is VALID [2022-04-08 08:17:37,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {23522#true} assume !(0 != ~p5~0); {23527#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:37,975 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 08:17:37,976 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 08:17:37,976 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 08:17:37,976 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 08:17:37,976 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 08:17:37,977 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 08:17:37,977 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 08:17:37,977 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 08:17:37,977 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 08:17:37,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {23527#(= main_~p5~0 0)} assume 0 != ~p5~0; {23523#false} is VALID [2022-04-08 08:17:37,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {23523#false} assume 1 != ~lk5~0; {23523#false} is VALID [2022-04-08 08:17:37,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {23523#false} assume !false; {23523#false} is VALID [2022-04-08 08:17:37,978 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 08:17:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:37,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913874498] [2022-04-08 08:17:37,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913874498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:37,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:37,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:37,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:37,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376658034] [2022-04-08 08:17:37,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376658034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:37,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:37,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:37,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562250624] [2022-04-08 08:17:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:37,979 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 08:17:37,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:37,979 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 08:17:37,998 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 08:17:37,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:37,999 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 08:17:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,304 INFO L93 Difference]: Finished difference Result 1661 states and 2657 transitions. [2022-04-08 08:17:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:38,304 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 08:17:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:38,304 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 08:17:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-08 08:17:38,306 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 08:17:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-08 08:17:38,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-08 08:17:38,406 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 08:17:38,439 INFO L225 Difference]: With dead ends: 1661 [2022-04-08 08:17:38,439 INFO L226 Difference]: Without dead ends: 971 [2022-04-08 08:17:38,440 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 08:17:38,441 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 08:17:38,441 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 08:17:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-08 08:17:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-08 08:17:38,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:38,505 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 08:17:38,506 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 08:17:38,507 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 08:17:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,537 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-08 08:17:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-08 08:17:38,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,540 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 08:17:38,542 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 08:17:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,575 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-08 08:17:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-08 08:17:38,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:38,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:38,578 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 08:17:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1527 transitions. [2022-04-08 08:17:38,621 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1527 transitions. Word has length 25 [2022-04-08 08:17:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:38,621 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1527 transitions. [2022-04-08 08:17:38,621 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 08:17:38,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1527 transitions. [2022-04-08 08:17:39,977 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 08:17:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1527 transitions. [2022-04-08 08:17:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:39,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:39,979 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 08:17:39,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:17:39,979 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 1 times [2022-04-08 08:17:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:39,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188247662] [2022-04-08 08:17:39,980 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 2 times [2022-04-08 08:17:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:39,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083322767] [2022-04-08 08:17:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:40,016 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 08:17:40,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-08 08:17:40,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-08 08:17:40,017 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 08:17:40,017 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 08:17:40,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {30736#true} assume true; {30736#true} is VALID [2022-04-08 08:17:40,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30736#true} {30736#true} #200#return; {30736#true} is VALID [2022-04-08 08:17:40,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {30736#true} call #t~ret15 := main(); {30736#true} is VALID [2022-04-08 08:17:40,017 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 08:17:40,017 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 08:17:40,017 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 08:17:40,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {30736#true} assume !(0 != ~p1~0); {30736#true} is VALID [2022-04-08 08:17:40,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {30736#true} assume !(0 != ~p2~0); {30736#true} is VALID [2022-04-08 08:17:40,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {30736#true} assume !(0 != ~p3~0); {30736#true} is VALID [2022-04-08 08:17:40,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {30736#true} assume !(0 != ~p4~0); {30736#true} is VALID [2022-04-08 08:17:40,018 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 08:17:40,018 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 08:17:40,019 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 08:17:40,019 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 08:17:40,019 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 08:17:40,020 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 08:17:40,020 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 08:17:40,020 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 08:17:40,020 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 08:17:40,021 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 08:17:40,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {30741#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {30737#false} is VALID [2022-04-08 08:17:40,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {30737#false} assume 0 != ~p6~0; {30737#false} is VALID [2022-04-08 08:17:40,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {30737#false} assume 1 != ~lk6~0; {30737#false} is VALID [2022-04-08 08:17:40,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {30737#false} assume !false; {30737#false} is VALID [2022-04-08 08:17:40,021 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 08:17:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083322767] [2022-04-08 08:17:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083322767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:40,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:40,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:40,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188247662] [2022-04-08 08:17:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188247662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:40,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:40,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511470924] [2022-04-08 08:17:40,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:40,023 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 08:17:40,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:40,023 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 08:17:40,037 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 08:17:40,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:40,038 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 08:17:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,304 INFO L93 Difference]: Finished difference Result 1453 states and 2281 transitions. [2022-04-08 08:17:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:40,304 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 08:17:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:40,304 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 08:17:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 08:17:40,306 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 08:17:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 08:17:40,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-08 08:17:40,409 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 08:17:40,444 INFO L225 Difference]: With dead ends: 1453 [2022-04-08 08:17:40,444 INFO L226 Difference]: Without dead ends: 987 [2022-04-08 08:17:40,445 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 08:17:40,446 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 08:17:40,446 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 08:17:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-08 08:17:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-08 08:17:40,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:40,506 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 08:17:40,507 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 08:17:40,508 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 08:17:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,538 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-08 08:17:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-08 08:17:40,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:40,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:40,541 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 08:17:40,542 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 08:17:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,571 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-08 08:17:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-08 08:17:40,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:40,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:40,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:40,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:40,573 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 08:17:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1527 transitions. [2022-04-08 08:17:40,615 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1527 transitions. Word has length 26 [2022-04-08 08:17:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:40,616 INFO L478 AbstractCegarLoop]: Abstraction has 985 states and 1527 transitions. [2022-04-08 08:17:40,616 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 08:17:40,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 985 states and 1527 transitions. [2022-04-08 08:17:41,955 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 08:17:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1527 transitions. [2022-04-08 08:17:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:41,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:41,957 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 08:17:41,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:17:41,958 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 1 times [2022-04-08 08:17:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:41,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257237125] [2022-04-08 08:17:41,958 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 2 times [2022-04-08 08:17:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:41,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608180593] [2022-04-08 08:17:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:41,994 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 08:17:41,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-08 08:17:41,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-08 08:17:41,994 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 08:17:41,994 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 08:17:41,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {37598#true} assume true; {37598#true} is VALID [2022-04-08 08:17:41,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37598#true} {37598#true} #200#return; {37598#true} is VALID [2022-04-08 08:17:41,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {37598#true} call #t~ret15 := main(); {37598#true} is VALID [2022-04-08 08:17:41,995 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 08:17:41,995 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 08:17:41,995 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 08:17:41,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {37598#true} assume !(0 != ~p1~0); {37598#true} is VALID [2022-04-08 08:17:41,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {37598#true} assume !(0 != ~p2~0); {37598#true} is VALID [2022-04-08 08:17:41,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {37598#true} assume !(0 != ~p3~0); {37598#true} is VALID [2022-04-08 08:17:41,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {37598#true} assume !(0 != ~p4~0); {37598#true} is VALID [2022-04-08 08:17:41,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {37598#true} assume !(0 != ~p5~0); {37598#true} is VALID [2022-04-08 08:17:41,996 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 08:17:41,996 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 08:17:41,996 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 08:17:41,996 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 08:17:41,996 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 08:17:41,997 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 08:17:41,997 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 08:17:41,997 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 08:17:41,997 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 08:17:41,998 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 08:17:41,998 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 08:17:41,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {37603#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {37599#false} is VALID [2022-04-08 08:17:41,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {37599#false} assume !false; {37599#false} is VALID [2022-04-08 08:17:41,998 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 08:17:41,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:41,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608180593] [2022-04-08 08:17:41,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608180593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:41,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:41,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:41,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:41,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257237125] [2022-04-08 08:17:41,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257237125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:41,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:41,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294221188] [2022-04-08 08:17:41,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:42,000 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 08:17:42,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:42,000 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 08:17:42,012 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 08:17:42,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:42,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:42,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:42,012 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 08:17:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:42,361 INFO L93 Difference]: Finished difference Result 1741 states and 2745 transitions. [2022-04-08 08:17:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:42,361 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 08:17:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:42,362 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 08:17:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 08:17:42,362 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 08:17:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 08:17:42,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-08 08:17:42,432 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 08:17:42,556 INFO L225 Difference]: With dead ends: 1741 [2022-04-08 08:17:42,556 INFO L226 Difference]: Without dead ends: 1739 [2022-04-08 08:17:42,557 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 08:17:42,557 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 08:17:42,557 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 08:17:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-08 08:17:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-08 08:17:42,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:42,644 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 08:17:42,645 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 08:17:42,646 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 08:17:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:42,731 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-08 08:17:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-08 08:17:42,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:42,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:42,735 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 08:17:42,736 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 08:17:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:42,820 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-08 08:17:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-08 08:17:42,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:42,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:42,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:42,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:42,824 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 08:17:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2022-04-08 08:17:42,927 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 26 [2022-04-08 08:17:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:42,927 INFO L478 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2022-04-08 08:17:42,927 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 08:17:42,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1417 states and 2135 transitions. [2022-04-08 08:17:44,863 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 08:17:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2022-04-08 08:17:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:44,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:44,865 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 08:17:44,865 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:17:44,865 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:44,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 1 times [2022-04-08 08:17:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:44,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494625881] [2022-04-08 08:17:44,866 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 2 times [2022-04-08 08:17:44,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:44,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556563307] [2022-04-08 08:17:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:44,930 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 08:17:44,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-08 08:17:44,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-08 08:17:44,930 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 08:17:44,930 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 08:17:44,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {47404#true} assume true; {47404#true} is VALID [2022-04-08 08:17:44,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47404#true} {47404#true} #200#return; {47404#true} is VALID [2022-04-08 08:17:44,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {47404#true} call #t~ret15 := main(); {47404#true} is VALID [2022-04-08 08:17:44,931 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 08:17:44,931 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 08:17:44,931 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 08:17:44,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {47404#true} assume !(0 != ~p1~0); {47404#true} is VALID [2022-04-08 08:17:44,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {47404#true} assume !(0 != ~p2~0); {47404#true} is VALID [2022-04-08 08:17:44,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {47404#true} assume !(0 != ~p3~0); {47404#true} is VALID [2022-04-08 08:17:44,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {47404#true} assume !(0 != ~p4~0); {47404#true} is VALID [2022-04-08 08:17:44,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {47404#true} assume !(0 != ~p5~0); {47404#true} is VALID [2022-04-08 08:17:44,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {47404#true} assume !(0 != ~p6~0); {47409#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:44,932 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 08:17:44,932 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 08:17:44,933 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 08:17:44,933 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 08:17:44,933 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 08:17:44,934 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 08:17:44,934 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 08:17:44,934 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 08:17:44,934 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 08:17:44,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {47409#(= main_~p6~0 0)} assume 0 != ~p6~0; {47405#false} is VALID [2022-04-08 08:17:44,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {47405#false} assume 1 != ~lk6~0; {47405#false} is VALID [2022-04-08 08:17:44,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {47405#false} assume !false; {47405#false} is VALID [2022-04-08 08:17:44,935 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 08:17:44,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:44,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556563307] [2022-04-08 08:17:44,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556563307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:44,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:44,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:44,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:44,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494625881] [2022-04-08 08:17:44,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494625881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:44,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:44,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:44,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832589828] [2022-04-08 08:17:44,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:44,936 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 08:17:44,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:44,937 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 08:17:44,954 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 08:17:44,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:44,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:44,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:44,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:44,955 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 08:17:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:45,716 INFO L93 Difference]: Finished difference Result 3277 states and 4953 transitions. [2022-04-08 08:17:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:45,716 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 08:17:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:45,716 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 08:17:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-08 08:17:45,717 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 08:17:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-08 08:17:45,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-08 08:17:45,814 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 08:17:45,947 INFO L225 Difference]: With dead ends: 3277 [2022-04-08 08:17:45,947 INFO L226 Difference]: Without dead ends: 1899 [2022-04-08 08:17:45,949 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 08:17:45,950 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 08:17:45,950 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 08:17:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-08 08:17:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-08 08:17:46,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:46,075 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 08:17:46,076 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 08:17:46,078 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 08:17:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:46,176 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-08 08:17:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-08 08:17:46,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:46,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:46,180 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 08:17:46,181 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 08:17:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:46,281 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-08 08:17:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-08 08:17:46,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:46,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:46,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:46,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:46,285 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 08:17:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2823 transitions. [2022-04-08 08:17:46,457 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2823 transitions. Word has length 26 [2022-04-08 08:17:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:46,457 INFO L478 AbstractCegarLoop]: Abstraction has 1897 states and 2823 transitions. [2022-04-08 08:17:46,458 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 08:17:46,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1897 states and 2823 transitions. [2022-04-08 08:17:49,083 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 08:17:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2823 transitions. [2022-04-08 08:17:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:49,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:49,085 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 08:17:49,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:17:49,085 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 1 times [2022-04-08 08:17:49,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:49,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1720620301] [2022-04-08 08:17:49,086 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 2 times [2022-04-08 08:17:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:49,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048975875] [2022-04-08 08:17:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:49,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:49,141 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 08:17:49,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-08 08:17:49,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-08 08:17:49,141 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 08:17:49,141 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 08:17:49,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {61562#true} assume true; {61562#true} is VALID [2022-04-08 08:17:49,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61562#true} {61562#true} #200#return; {61562#true} is VALID [2022-04-08 08:17:49,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {61562#true} call #t~ret15 := main(); {61562#true} is VALID [2022-04-08 08:17:49,142 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 08:17:49,142 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 08:17:49,142 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 08:17:49,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {61562#true} assume !(0 != ~p1~0); {61562#true} is VALID [2022-04-08 08:17:49,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {61562#true} assume !(0 != ~p2~0); {61562#true} is VALID [2022-04-08 08:17:49,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {61562#true} assume !(0 != ~p3~0); {61562#true} is VALID [2022-04-08 08:17:49,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {61562#true} assume !(0 != ~p4~0); {61562#true} is VALID [2022-04-08 08:17:49,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {61562#true} assume !(0 != ~p5~0); {61562#true} is VALID [2022-04-08 08:17:49,142 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 08:17:49,143 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 08:17:49,143 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 08:17:49,143 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 08:17:49,143 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 08:17:49,144 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 08:17:49,144 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 08:17:49,144 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 08:17:49,144 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 08:17:49,145 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 08:17:49,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {61567#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {61563#false} is VALID [2022-04-08 08:17:49,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {61563#false} assume 0 != ~p7~0; {61563#false} is VALID [2022-04-08 08:17:49,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {61563#false} assume 1 != ~lk7~0; {61563#false} is VALID [2022-04-08 08:17:49,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {61563#false} assume !false; {61563#false} is VALID [2022-04-08 08:17:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:49,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048975875] [2022-04-08 08:17:49,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048975875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:49,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:49,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:49,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:49,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1720620301] [2022-04-08 08:17:49,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1720620301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:49,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:49,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869833493] [2022-04-08 08:17:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:49,146 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 08:17:49,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:49,146 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 08:17:49,160 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 08:17:49,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:49,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:49,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:49,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:49,160 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 08:17:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:49,734 INFO L93 Difference]: Finished difference Result 2845 states and 4217 transitions. [2022-04-08 08:17:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:49,734 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 08:17:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:49,734 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 08:17:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-08 08:17:49,735 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 08:17:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-08 08:17:49,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-08 08:17:49,829 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 08:17:49,969 INFO L225 Difference]: With dead ends: 2845 [2022-04-08 08:17:49,969 INFO L226 Difference]: Without dead ends: 1931 [2022-04-08 08:17:49,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 08:17:49,970 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 08:17:49,970 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 08:17:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-08 08:17:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-08 08:17:50,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:50,094 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 08:17:50,096 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 08:17:50,097 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 08:17:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:50,198 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-08 08:17:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-08 08:17:50,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:50,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:50,203 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 08:17:50,204 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 08:17:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:50,307 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-08 08:17:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-08 08:17:50,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:50,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:50,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:50,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:50,312 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 08:17:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2823 transitions. [2022-04-08 08:17:50,498 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2823 transitions. Word has length 27 [2022-04-08 08:17:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:50,501 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 2823 transitions. [2022-04-08 08:17:50,501 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 08:17:50,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 2823 transitions. [2022-04-08 08:17:53,120 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 08:17:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2823 transitions. [2022-04-08 08:17:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:53,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:53,121 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 08:17:53,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:17:53,122 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 1 times [2022-04-08 08:17:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:53,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020160645] [2022-04-08 08:17:53,122 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 2 times [2022-04-08 08:17:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:53,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550331681] [2022-04-08 08:17:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:53,157 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 08:17:53,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-08 08:17:53,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-08 08:17:53,158 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 08:17:53,158 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 08:17:53,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {74984#true} assume true; {74984#true} is VALID [2022-04-08 08:17:53,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74984#true} {74984#true} #200#return; {74984#true} is VALID [2022-04-08 08:17:53,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {74984#true} call #t~ret15 := main(); {74984#true} is VALID [2022-04-08 08:17:53,158 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 08:17:53,158 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 08:17:53,158 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 08:17:53,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {74984#true} assume !(0 != ~p1~0); {74984#true} is VALID [2022-04-08 08:17:53,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {74984#true} assume !(0 != ~p2~0); {74984#true} is VALID [2022-04-08 08:17:53,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {74984#true} assume !(0 != ~p3~0); {74984#true} is VALID [2022-04-08 08:17:53,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {74984#true} assume !(0 != ~p4~0); {74984#true} is VALID [2022-04-08 08:17:53,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {74984#true} assume !(0 != ~p5~0); {74984#true} is VALID [2022-04-08 08:17:53,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {74984#true} assume !(0 != ~p6~0); {74984#true} is VALID [2022-04-08 08:17:53,168 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 08:17:53,169 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 08:17:53,169 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 08:17:53,169 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 08:17:53,169 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 08:17:53,170 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 08:17:53,170 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 08:17:53,170 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 08:17:53,170 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 08:17:53,171 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 08:17:53,171 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 08:17:53,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {74989#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {74985#false} is VALID [2022-04-08 08:17:53,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {74985#false} assume !false; {74985#false} is VALID [2022-04-08 08:17:53,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 08:17:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550331681] [2022-04-08 08:17:53,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550331681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:53,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:53,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:53,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:53,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020160645] [2022-04-08 08:17:53,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020160645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:53,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:53,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:53,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082107879] [2022-04-08 08:17:53,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:53,173 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 08:17:53,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:53,174 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 08:17:53,186 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 08:17:53,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:53,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:53,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:53,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:53,187 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 08:17:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:54,017 INFO L93 Difference]: Finished difference Result 3341 states and 4969 transitions. [2022-04-08 08:17:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:54,017 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 08:17:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:54,017 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 08:17:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-08 08:17:54,018 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 08:17:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-08 08:17:54,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-08 08:17:54,082 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 08:17:54,543 INFO L225 Difference]: With dead ends: 3341 [2022-04-08 08:17:54,543 INFO L226 Difference]: Without dead ends: 3339 [2022-04-08 08:17:54,544 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 08:17:54,544 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 08:17:54,544 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 08:17:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-08 08:17:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-08 08:17:54,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:54,737 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 08:17:54,738 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 08:17:54,740 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 08:17:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:55,099 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-08 08:17:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-08 08:17:55,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:55,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:55,105 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 08:17:55,107 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 08:17:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:55,438 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-08 08:17:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-08 08:17:55,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:55,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:55,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:55,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:55,444 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 08:17:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4007 transitions. [2022-04-08 08:17:55,815 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4007 transitions. Word has length 27 [2022-04-08 08:17:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:55,815 INFO L478 AbstractCegarLoop]: Abstraction has 2825 states and 4007 transitions. [2022-04-08 08:17:55,815 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 08:17:55,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2825 states and 4007 transitions. [2022-04-08 08:17:59,597 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 08:17:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4007 transitions. [2022-04-08 08:17:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:59,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:59,600 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 08:17:59,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:17:59,600 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 1 times [2022-04-08 08:17:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:59,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1491415004] [2022-04-08 08:17:59,601 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 2 times [2022-04-08 08:17:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:59,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651993463] [2022-04-08 08:17:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:59,639 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 08:17:59,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-08 08:17:59,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-08 08:17:59,640 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 08:17:59,640 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 08:17:59,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {94006#true} assume true; {94006#true} is VALID [2022-04-08 08:17:59,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94006#true} {94006#true} #200#return; {94006#true} is VALID [2022-04-08 08:17:59,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {94006#true} call #t~ret15 := main(); {94006#true} is VALID [2022-04-08 08:17:59,641 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 08:17:59,641 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 08:17:59,641 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 08:17:59,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {94006#true} assume !(0 != ~p1~0); {94006#true} is VALID [2022-04-08 08:17:59,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {94006#true} assume !(0 != ~p2~0); {94006#true} is VALID [2022-04-08 08:17:59,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {94006#true} assume !(0 != ~p3~0); {94006#true} is VALID [2022-04-08 08:17:59,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {94006#true} assume !(0 != ~p4~0); {94006#true} is VALID [2022-04-08 08:17:59,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {94006#true} assume !(0 != ~p5~0); {94006#true} is VALID [2022-04-08 08:17:59,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {94006#true} assume !(0 != ~p6~0); {94006#true} is VALID [2022-04-08 08:17:59,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {94006#true} assume !(0 != ~p7~0); {94011#(= main_~p7~0 0)} is VALID [2022-04-08 08:17:59,642 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 08:17:59,643 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 08:17:59,643 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 08:17:59,643 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 08:17:59,644 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 08:17:59,644 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 08:17:59,644 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 08:17:59,645 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 08:17:59,645 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 08:17:59,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {94011#(= main_~p7~0 0)} assume 0 != ~p7~0; {94007#false} is VALID [2022-04-08 08:17:59,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {94007#false} assume 1 != ~lk7~0; {94007#false} is VALID [2022-04-08 08:17:59,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {94007#false} assume !false; {94007#false} is VALID [2022-04-08 08:17:59,645 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 08:17:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:59,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651993463] [2022-04-08 08:17:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651993463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:59,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:59,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:59,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1491415004] [2022-04-08 08:17:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1491415004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:59,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443964064] [2022-04-08 08:17:59,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:59,646 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 08:17:59,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:59,647 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 08:17:59,659 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 08:17:59,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:59,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:59,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:59,660 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 08:18:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:02,017 INFO L93 Difference]: Finished difference Result 6477 states and 9193 transitions. [2022-04-08 08:18:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:02,018 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 08:18:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:02,018 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 08:18:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-08 08:18:02,019 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 08:18:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-08 08:18:02,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-08 08:18:02,116 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 08:18:02,678 INFO L225 Difference]: With dead ends: 6477 [2022-04-08 08:18:02,678 INFO L226 Difference]: Without dead ends: 3723 [2022-04-08 08:18:02,681 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 08:18:02,682 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 08:18:02,682 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 08:18:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-08 08:18:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-08 08:18:02,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:02,955 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 08:18:02,957 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 08:18:02,959 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 08:18:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:03,363 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-08 08:18:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-08 08:18:03,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:03,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:03,370 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 08:18:03,372 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 08:18:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:03,782 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-08 08:18:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-08 08:18:03,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:03,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:03,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:03,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:03,789 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 08:18:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5191 transitions. [2022-04-08 08:18:04,438 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5191 transitions. Word has length 27 [2022-04-08 08:18:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:04,438 INFO L478 AbstractCegarLoop]: Abstraction has 3721 states and 5191 transitions. [2022-04-08 08:18:04,439 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 08:18:04,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3721 states and 5191 transitions. [2022-04-08 08:18:09,468 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 08:18:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5191 transitions. [2022-04-08 08:18:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:18:09,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:09,471 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 08:18:09,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:18:09,471 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:09,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 1 times [2022-04-08 08:18:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:09,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [594503002] [2022-04-08 08:18:09,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 2 times [2022-04-08 08:18:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:09,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899531134] [2022-04-08 08:18:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:09,503 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 08:18:09,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-08 08:18:09,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-08 08:18:09,504 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 08:18:09,504 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 08:18:09,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {121860#true} assume true; {121860#true} is VALID [2022-04-08 08:18:09,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121860#true} {121860#true} #200#return; {121860#true} is VALID [2022-04-08 08:18:09,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {121860#true} call #t~ret15 := main(); {121860#true} is VALID [2022-04-08 08:18:09,504 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 08:18:09,504 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 08:18:09,504 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 08:18:09,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {121860#true} assume !(0 != ~p1~0); {121860#true} is VALID [2022-04-08 08:18:09,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {121860#true} assume !(0 != ~p2~0); {121860#true} is VALID [2022-04-08 08:18:09,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {121860#true} assume !(0 != ~p3~0); {121860#true} is VALID [2022-04-08 08:18:09,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {121860#true} assume !(0 != ~p4~0); {121860#true} is VALID [2022-04-08 08:18:09,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {121860#true} assume !(0 != ~p5~0); {121860#true} is VALID [2022-04-08 08:18:09,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {121860#true} assume !(0 != ~p6~0); {121860#true} is VALID [2022-04-08 08:18:09,505 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 08:18:09,505 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 08:18:09,506 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 08:18:09,506 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 08:18:09,506 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 08:18:09,506 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 08:18:09,506 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 08:18:09,507 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 08:18:09,507 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 08:18:09,507 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 08:18:09,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {121865#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {121861#false} is VALID [2022-04-08 08:18:09,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {121861#false} assume 0 != ~p8~0; {121861#false} is VALID [2022-04-08 08:18:09,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {121861#false} assume 1 != ~lk8~0; {121861#false} is VALID [2022-04-08 08:18:09,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {121861#false} assume !false; {121861#false} is VALID [2022-04-08 08:18:09,508 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 08:18:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:09,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899531134] [2022-04-08 08:18:09,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899531134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:09,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:09,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:09,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:09,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [594503002] [2022-04-08 08:18:09,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [594503002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:09,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:09,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639249178] [2022-04-08 08:18:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:09,509 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 08:18:09,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:09,509 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 08:18:09,523 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 08:18:09,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:09,524 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 08:18:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:11,341 INFO L93 Difference]: Finished difference Result 5581 states and 7753 transitions. [2022-04-08 08:18:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:11,342 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 08:18:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:11,342 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 08:18:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-08 08:18:11,343 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 08:18:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-08 08:18:11,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-08 08:18:11,437 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 08:18:11,993 INFO L225 Difference]: With dead ends: 5581 [2022-04-08 08:18:11,994 INFO L226 Difference]: Without dead ends: 3787 [2022-04-08 08:18:11,995 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 08:18:11,996 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:11,996 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.1s Time] [2022-04-08 08:18:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-08 08:18:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-08 08:18:12,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:12,280 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 08:18:12,282 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 08:18:12,284 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 08:18:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:12,694 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-08 08:18:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-08 08:18:12,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:12,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:12,700 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 08:18:12,702 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 08:18:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:13,110 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-08 08:18:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-08 08:18:13,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:13,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:13,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:13,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:13,117 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 08:18:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5191 transitions. [2022-04-08 08:18:13,808 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5191 transitions. Word has length 28 [2022-04-08 08:18:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:13,808 INFO L478 AbstractCegarLoop]: Abstraction has 3785 states and 5191 transitions. [2022-04-08 08:18:13,808 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 08:18:13,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3785 states and 5191 transitions. [2022-04-08 08:18:18,911 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 08:18:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5191 transitions. [2022-04-08 08:18:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:18:18,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:18,915 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 08:18:18,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:18:18,915 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 1 times [2022-04-08 08:18:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:18,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748922148] [2022-04-08 08:18:18,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 2 times [2022-04-08 08:18:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:18,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758997719] [2022-04-08 08:18:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:18,955 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 08:18:18,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-08 08:18:18,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-08 08:18:18,956 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 08:18:18,956 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 08:18:18,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {148178#true} assume true; {148178#true} is VALID [2022-04-08 08:18:18,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148178#true} {148178#true} #200#return; {148178#true} is VALID [2022-04-08 08:18:18,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {148178#true} call #t~ret15 := main(); {148178#true} is VALID [2022-04-08 08:18:18,956 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 08:18:18,956 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 08:18:18,956 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 08:18:18,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {148178#true} assume !(0 != ~p1~0); {148178#true} is VALID [2022-04-08 08:18:18,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {148178#true} assume !(0 != ~p2~0); {148178#true} is VALID [2022-04-08 08:18:18,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {148178#true} assume !(0 != ~p3~0); {148178#true} is VALID [2022-04-08 08:18:18,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {148178#true} assume !(0 != ~p4~0); {148178#true} is VALID [2022-04-08 08:18:18,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {148178#true} assume !(0 != ~p5~0); {148178#true} is VALID [2022-04-08 08:18:18,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {148178#true} assume !(0 != ~p6~0); {148178#true} is VALID [2022-04-08 08:18:18,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {148178#true} assume !(0 != ~p7~0); {148178#true} is VALID [2022-04-08 08:18:18,957 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 08:18:18,957 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 08:18:18,958 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 08:18:18,958 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 08:18:18,958 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 08:18:18,958 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 08:18:18,959 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 08:18:18,959 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 08:18:18,959 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 08:18:18,959 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 08:18:18,960 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 08:18:18,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {148183#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {148179#false} is VALID [2022-04-08 08:18:18,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {148179#false} assume !false; {148179#false} is VALID [2022-04-08 08:18:18,960 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 08:18:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:18,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758997719] [2022-04-08 08:18:18,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758997719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:18,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:18,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:18,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748922148] [2022-04-08 08:18:18,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748922148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:18,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:18,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004270903] [2022-04-08 08:18:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:18,961 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 08:18:18,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:18,961 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 08:18:18,974 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 08:18:18,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:18,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:18,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:18,975 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 08:18:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:21,449 INFO L93 Difference]: Finished difference Result 6413 states and 8905 transitions. [2022-04-08 08:18:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:21,450 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 08:18:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:21,450 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 08:18:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 08:18:21,451 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 08:18:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 08:18:21,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 08:18:21,512 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 08:18:23,163 INFO L225 Difference]: With dead ends: 6413 [2022-04-08 08:18:23,163 INFO L226 Difference]: Without dead ends: 6411 [2022-04-08 08:18:23,164 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 08:18:23,165 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 08:18:23,165 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 08:18:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-08 08:18:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-08 08:18:23,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:23,587 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 08:18:23,590 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 08:18:23,593 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 08:18:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:24,802 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-08 08:18:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-08 08:18:24,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:24,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:24,814 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 08:18:24,820 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 08:18:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:26,079 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-08 08:18:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-08 08:18:26,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:26,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:26,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:26,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:26,089 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 08:18:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7495 transitions. [2022-04-08 08:18:27,481 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7495 transitions. Word has length 28 [2022-04-08 08:18:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:27,482 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 7495 transitions. [2022-04-08 08:18:27,482 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 08:18:27,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 7495 transitions. [2022-04-08 08:18:35,068 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 08:18:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7495 transitions. [2022-04-08 08:18:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:18:35,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:35,072 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 08:18:35,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:18:35,073 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:35,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 1 times [2022-04-08 08:18:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:35,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706281560] [2022-04-08 08:18:35,073 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 2 times [2022-04-08 08:18:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:35,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667025754] [2022-04-08 08:18:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:35,111 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 08:18:35,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-08 08:18:35,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-08 08:18:35,112 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 08:18:35,112 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 08:18:35,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {185120#true} assume true; {185120#true} is VALID [2022-04-08 08:18:35,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185120#true} {185120#true} #200#return; {185120#true} is VALID [2022-04-08 08:18:35,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {185120#true} call #t~ret15 := main(); {185120#true} is VALID [2022-04-08 08:18:35,112 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 08:18:35,112 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 08:18:35,112 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 08:18:35,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {185120#true} assume !(0 != ~p1~0); {185120#true} is VALID [2022-04-08 08:18:35,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {185120#true} assume !(0 != ~p2~0); {185120#true} is VALID [2022-04-08 08:18:35,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {185120#true} assume !(0 != ~p3~0); {185120#true} is VALID [2022-04-08 08:18:35,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {185120#true} assume !(0 != ~p4~0); {185120#true} is VALID [2022-04-08 08:18:35,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {185120#true} assume !(0 != ~p5~0); {185120#true} is VALID [2022-04-08 08:18:35,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {185120#true} assume !(0 != ~p6~0); {185120#true} is VALID [2022-04-08 08:18:35,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {185120#true} assume !(0 != ~p7~0); {185120#true} is VALID [2022-04-08 08:18:35,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {185120#true} assume !(0 != ~p8~0); {185125#(= main_~p8~0 0)} is VALID [2022-04-08 08:18:35,114 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 08:18:35,114 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 08:18:35,114 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 08:18:35,114 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 08:18:35,115 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 08:18:35,115 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 08:18:35,115 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 08:18:35,115 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 08:18:35,116 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 08:18:35,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {185125#(= main_~p8~0 0)} assume 0 != ~p8~0; {185121#false} is VALID [2022-04-08 08:18:35,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {185121#false} assume 1 != ~lk8~0; {185121#false} is VALID [2022-04-08 08:18:35,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {185121#false} assume !false; {185121#false} is VALID [2022-04-08 08:18:35,116 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 08:18:35,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:35,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667025754] [2022-04-08 08:18:35,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667025754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:35,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:35,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:35,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:35,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706281560] [2022-04-08 08:18:35,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706281560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:35,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:35,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183763440] [2022-04-08 08:18:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:35,117 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 08:18:35,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:35,118 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 08:18:35,132 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 08:18:35,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:35,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:35,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:35,133 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 08:18:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:43,501 INFO L93 Difference]: Finished difference Result 12813 states and 16969 transitions. [2022-04-08 08:18:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:43,501 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 08:18:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:43,501 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 08:18:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 08:18:43,503 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 08:18:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 08:18:43,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-08 08:18:43,598 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 08:18:45,702 INFO L225 Difference]: With dead ends: 12813 [2022-04-08 08:18:45,702 INFO L226 Difference]: Without dead ends: 7307 [2022-04-08 08:18:45,708 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 08:18:45,708 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 08:18:45,708 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 08:18:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-08 08:18:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-08 08:18:46,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:46,254 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 08:18:46,258 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 08:18:46,262 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 08:18:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:47,796 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-08 08:18:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-08 08:18:47,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:47,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:47,808 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 08:18:47,812 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 08:18:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:49,358 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-08 08:18:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-08 08:18:49,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:49,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:49,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:49,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:49,370 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 08:18:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9479 transitions. [2022-04-08 08:18:51,904 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9479 transitions. Word has length 28 [2022-04-08 08:18:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:51,904 INFO L478 AbstractCegarLoop]: Abstraction has 7305 states and 9479 transitions. [2022-04-08 08:18:51,904 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 08:18:51,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7305 states and 9479 transitions. [2022-04-08 08:19:01,558 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 08:19:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9479 transitions. [2022-04-08 08:19:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:19:01,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:01,562 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 08:19:01,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:19:01,563 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:01,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 1 times [2022-04-08 08:19:01,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:01,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201304798] [2022-04-08 08:19:01,563 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 2 times [2022-04-08 08:19:01,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:01,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578786272] [2022-04-08 08:19:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:01,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:01,591 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 08:19:01,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-08 08:19:01,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-08 08:19:01,591 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 08:19:01,591 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 08:19:01,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {239982#true} assume true; {239982#true} is VALID [2022-04-08 08:19:01,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239982#true} {239982#true} #200#return; {239982#true} is VALID [2022-04-08 08:19:01,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {239982#true} call #t~ret15 := main(); {239982#true} is VALID [2022-04-08 08:19:01,592 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 08:19:01,592 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 08:19:01,592 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 08:19:01,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {239982#true} assume !(0 != ~p1~0); {239982#true} is VALID [2022-04-08 08:19:01,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {239982#true} assume !(0 != ~p2~0); {239982#true} is VALID [2022-04-08 08:19:01,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {239982#true} assume !(0 != ~p3~0); {239982#true} is VALID [2022-04-08 08:19:01,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {239982#true} assume !(0 != ~p4~0); {239982#true} is VALID [2022-04-08 08:19:01,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {239982#true} assume !(0 != ~p5~0); {239982#true} is VALID [2022-04-08 08:19:01,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {239982#true} assume !(0 != ~p6~0); {239982#true} is VALID [2022-04-08 08:19:01,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {239982#true} assume !(0 != ~p7~0); {239982#true} is VALID [2022-04-08 08:19:01,592 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 08:19:01,593 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 08:19:01,593 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 08:19:01,593 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 08:19:01,594 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 08:19:01,594 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 08:19:01,594 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 08:19:01,594 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 08:19:01,595 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 08:19:01,595 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 08:19:01,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {239987#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {239983#false} is VALID [2022-04-08 08:19:01,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {239983#false} assume 0 != ~p9~0; {239983#false} is VALID [2022-04-08 08:19:01,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {239983#false} assume 1 != ~lk9~0; {239983#false} is VALID [2022-04-08 08:19:01,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {239983#false} assume !false; {239983#false} is VALID [2022-04-08 08:19:01,595 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 08:19:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:01,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578786272] [2022-04-08 08:19:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578786272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:01,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:01,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:01,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:01,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201304798] [2022-04-08 08:19:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201304798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:01,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:01,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909728901] [2022-04-08 08:19:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:01,596 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 08:19:01,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:01,597 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 08:19:01,612 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 08:19:01,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:01,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:01,613 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 08:19:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:07,687 INFO L93 Difference]: Finished difference Result 10957 states and 14153 transitions. [2022-04-08 08:19:07,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:07,687 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 08:19:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:07,687 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 08:19:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-08 08:19:07,688 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 08:19:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-08 08:19:07,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-08 08:19:07,801 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 08:19:10,025 INFO L225 Difference]: With dead ends: 10957 [2022-04-08 08:19:10,025 INFO L226 Difference]: Without dead ends: 7435 [2022-04-08 08:19:10,029 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 08:19:10,029 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 08:19:10,029 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 08:19:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-08 08:19:10,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-08 08:19:10,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:10,606 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 08:19:10,612 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 08:19:10,617 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 08:19:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,131 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-08 08:19:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-08 08:19:12,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,145 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 08:19:12,151 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 08:19:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,691 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-08 08:19:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-08 08:19:13,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:13,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:13,705 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 08:19:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9479 transitions. [2022-04-08 08:19:16,288 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9479 transitions. Word has length 29 [2022-04-08 08:19:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:16,288 INFO L478 AbstractCegarLoop]: Abstraction has 7433 states and 9479 transitions. [2022-04-08 08:19:16,288 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 08:19:16,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7433 states and 9479 transitions. [2022-04-08 08:19:25,851 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 08:19:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9479 transitions. [2022-04-08 08:19:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:19:25,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:25,856 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 08:19:25,856 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:19:25,856 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:25,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 1 times [2022-04-08 08:19:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:25,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929555639] [2022-04-08 08:19:25,856 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 2 times [2022-04-08 08:19:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:25,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35851666] [2022-04-08 08:19:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:25,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:25,892 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 08:19:25,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-08 08:19:25,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-08 08:19:25,893 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 08:19:25,893 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 08:19:25,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {291644#true} assume true; {291644#true} is VALID [2022-04-08 08:19:25,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291644#true} {291644#true} #200#return; {291644#true} is VALID [2022-04-08 08:19:25,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {291644#true} call #t~ret15 := main(); {291644#true} is VALID [2022-04-08 08:19:25,893 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 08:19:25,893 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 08:19:25,893 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 08:19:25,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {291644#true} assume !(0 != ~p1~0); {291644#true} is VALID [2022-04-08 08:19:25,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {291644#true} assume !(0 != ~p2~0); {291644#true} is VALID [2022-04-08 08:19:25,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {291644#true} assume !(0 != ~p3~0); {291644#true} is VALID [2022-04-08 08:19:25,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {291644#true} assume !(0 != ~p4~0); {291644#true} is VALID [2022-04-08 08:19:25,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {291644#true} assume !(0 != ~p5~0); {291644#true} is VALID [2022-04-08 08:19:25,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {291644#true} assume !(0 != ~p6~0); {291644#true} is VALID [2022-04-08 08:19:25,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {291644#true} assume !(0 != ~p7~0); {291644#true} is VALID [2022-04-08 08:19:25,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {291644#true} assume !(0 != ~p8~0); {291644#true} is VALID [2022-04-08 08:19:25,895 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 08:19:25,895 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 08:19:25,895 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 08:19:25,896 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 08:19:25,896 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 08:19:25,896 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 08:19:25,896 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 08:19:25,897 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 08:19:25,897 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 08:19:25,898 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 08:19:25,898 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 08:19:25,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {291649#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {291645#false} is VALID [2022-04-08 08:19:25,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {291645#false} assume !false; {291645#false} is VALID [2022-04-08 08:19:25,900 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 08:19:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35851666] [2022-04-08 08:19:25,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35851666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:25,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:25,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:25,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929555639] [2022-04-08 08:19:25,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929555639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:25,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:25,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251754298] [2022-04-08 08:19:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:25,901 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 08:19:25,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:25,901 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 08:19:25,915 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 08:19:25,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:25,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:25,916 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 08:19:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:34,243 INFO L93 Difference]: Finished difference Result 12301 states and 15753 transitions. [2022-04-08 08:19:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:34,243 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 08:19:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:34,243 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 08:19:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 08:19:34,244 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 08:19:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 08:19:34,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-08 08:19:34,308 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 08:19:40,561 INFO L225 Difference]: With dead ends: 12301 [2022-04-08 08:19:40,561 INFO L226 Difference]: Without dead ends: 12299 [2022-04-08 08:19:40,563 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 08:19:40,564 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 08:19:40,564 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 08:19:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-08 08:19:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-08 08:19:41,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:41,491 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 08:19:41,504 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 08:19:41,516 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 08:19:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:45,622 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-08 08:19:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-08 08:19:45,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:45,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:45,642 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 08:19:45,652 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 08:19:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:50,370 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-08 08:19:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-08 08:19:50,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:50,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:50,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:50,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:50,390 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 08:19:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13959 transitions. [2022-04-08 08:19:56,018 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13959 transitions. Word has length 29 [2022-04-08 08:19:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:56,018 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 13959 transitions. [2022-04-08 08:19:56,018 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 08:19:56,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 13959 transitions. [2022-04-08 08:20:10,548 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 08:20:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13959 transitions. [2022-04-08 08:20:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:20:10,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:10,571 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 08:20:10,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:20:10,571 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:10,571 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 1 times [2022-04-08 08:20:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:10,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200934107] [2022-04-08 08:20:10,574 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 2 times [2022-04-08 08:20:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:10,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306670449] [2022-04-08 08:20:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:10,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:10,610 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 08:20:10,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-08 08:20:10,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-08 08:20:10,610 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 08:20:10,611 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 08:20:10,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {363402#true} assume true; {363402#true} is VALID [2022-04-08 08:20:10,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363402#true} {363402#true} #200#return; {363402#true} is VALID [2022-04-08 08:20:10,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {363402#true} call #t~ret15 := main(); {363402#true} is VALID [2022-04-08 08:20:10,611 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 08:20:10,611 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 08:20:10,611 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 08:20:10,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {363402#true} assume !(0 != ~p1~0); {363402#true} is VALID [2022-04-08 08:20:10,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {363402#true} assume !(0 != ~p2~0); {363402#true} is VALID [2022-04-08 08:20:10,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {363402#true} assume !(0 != ~p3~0); {363402#true} is VALID [2022-04-08 08:20:10,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {363402#true} assume !(0 != ~p4~0); {363402#true} is VALID [2022-04-08 08:20:10,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {363402#true} assume !(0 != ~p5~0); {363402#true} is VALID [2022-04-08 08:20:10,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {363402#true} assume !(0 != ~p6~0); {363402#true} is VALID [2022-04-08 08:20:10,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {363402#true} assume !(0 != ~p7~0); {363402#true} is VALID [2022-04-08 08:20:10,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {363402#true} assume !(0 != ~p8~0); {363402#true} is VALID [2022-04-08 08:20:10,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {363402#true} assume !(0 != ~p9~0); {363407#(= main_~p9~0 0)} is VALID [2022-04-08 08:20:10,612 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 08:20:10,612 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 08:20:10,613 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 08:20:10,613 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 08:20:10,613 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 08:20:10,613 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 08:20:10,614 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 08:20:10,614 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 08:20:10,614 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 08:20:10,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {363407#(= main_~p9~0 0)} assume 0 != ~p9~0; {363403#false} is VALID [2022-04-08 08:20:10,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {363403#false} assume 1 != ~lk9~0; {363403#false} is VALID [2022-04-08 08:20:10,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {363403#false} assume !false; {363403#false} is VALID [2022-04-08 08:20:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:20:10,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:10,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306670449] [2022-04-08 08:20:10,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306670449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:10,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:10,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:10,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:10,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200934107] [2022-04-08 08:20:10,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200934107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:10,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:10,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:10,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320197178] [2022-04-08 08:20:10,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:10,616 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 08:20:10,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:10,616 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 08:20:10,637 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 08:20:10,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:10,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:10,638 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 08:20:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:43,708 INFO L93 Difference]: Finished difference Result 25357 states and 31113 transitions. [2022-04-08 08:20:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:43,708 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 08:20:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:43,709 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 08:20:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-08 08:20:43,709 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 08:20:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-08 08:20:43,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-08 08:20:43,802 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 08:20:52,236 INFO L225 Difference]: With dead ends: 25357 [2022-04-08 08:20:52,236 INFO L226 Difference]: Without dead ends: 14347 [2022-04-08 08:20:52,248 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 08:20:52,248 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 08:20:52,248 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 08:20:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-08 08:20:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-08 08:20:53,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:53,387 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 08:20:53,403 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 08:20:53,420 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 08:20:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:59,613 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-08 08:20:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-08 08:20:59,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:59,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:59,640 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 08:20:59,655 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 08:21:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:05,513 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-08 08:21:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-08 08:21:05,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:05,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:05,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:21:05,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:21:05,537 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 08:21:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 17159 transitions. [2022-04-08 08:21:15,365 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 17159 transitions. Word has length 29 [2022-04-08 08:21:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:21:15,366 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 17159 transitions. [2022-04-08 08:21:15,366 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 08:21:15,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 17159 transitions. [2022-04-08 08:21:32,897 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 08:21:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 17159 transitions. [2022-04-08 08:21:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:21:32,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:21:32,906 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 08:21:32,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:21:32,906 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:21:32,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:21:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 1 times [2022-04-08 08:21:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:32,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1976166965] [2022-04-08 08:21:32,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:21:32,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 2 times [2022-04-08 08:21:32,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:21:32,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882612552] [2022-04-08 08:21:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:21:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:21:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:21:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:32,949 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 08:21:32,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-08 08:21:32,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-08 08:21:32,950 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 08:21:32,950 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 08:21:32,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {471512#true} assume true; {471512#true} is VALID [2022-04-08 08:21:32,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471512#true} {471512#true} #200#return; {471512#true} is VALID [2022-04-08 08:21:32,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {471512#true} call #t~ret15 := main(); {471512#true} is VALID [2022-04-08 08:21:32,950 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 08:21:32,950 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 08:21:32,950 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 08:21:32,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {471512#true} assume !(0 != ~p1~0); {471512#true} is VALID [2022-04-08 08:21:32,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {471512#true} assume !(0 != ~p2~0); {471512#true} is VALID [2022-04-08 08:21:32,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {471512#true} assume !(0 != ~p3~0); {471512#true} is VALID [2022-04-08 08:21:32,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {471512#true} assume !(0 != ~p4~0); {471512#true} is VALID [2022-04-08 08:21:32,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {471512#true} assume !(0 != ~p5~0); {471512#true} is VALID [2022-04-08 08:21:32,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {471512#true} assume !(0 != ~p6~0); {471512#true} is VALID [2022-04-08 08:21:32,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {471512#true} assume !(0 != ~p7~0); {471512#true} is VALID [2022-04-08 08:21:32,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {471512#true} assume !(0 != ~p8~0); {471512#true} is VALID [2022-04-08 08:21:32,951 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 08:21:32,951 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 08:21:32,952 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 08:21:32,952 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 08:21:32,952 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 08:21:32,952 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 08:21:32,953 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 08:21:32,953 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 08:21:32,953 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 08:21:32,953 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 08:21:32,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {471517#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {471513#false} is VALID [2022-04-08 08:21:32,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {471513#false} assume 0 != ~p10~0; {471513#false} is VALID [2022-04-08 08:21:32,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {471513#false} assume 1 != ~lk10~0; {471513#false} is VALID [2022-04-08 08:21:32,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {471513#false} assume !false; {471513#false} is VALID [2022-04-08 08:21:32,954 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 08:21:32,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:21:32,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882612552] [2022-04-08 08:21:32,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882612552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:32,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:32,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:32,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:21:32,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1976166965] [2022-04-08 08:21:32,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1976166965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:32,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:32,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991514467] [2022-04-08 08:21:32,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:21:32,955 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 08:21:32,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:21:32,955 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 08:21:32,971 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 08:21:32,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:21:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:32,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:21:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:21:32,975 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 08:21:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:56,780 INFO L93 Difference]: Finished difference Result 21517 states and 25609 transitions. [2022-04-08 08:21:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:21:56,780 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 08:21:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:21:56,780 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 08:21:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 08:21:56,781 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 08:21:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 08:21:56,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 08:21:56,871 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 08:22:05,649 INFO L225 Difference]: With dead ends: 21517 [2022-04-08 08:22:05,649 INFO L226 Difference]: Without dead ends: 14603 [2022-04-08 08:22:05,657 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 08:22:05,658 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 08:22:05,658 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 08:22:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-08 08:22:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-08 08:22:06,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:22:06,798 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 08:22:06,812 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 08:22:06,825 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 08:22:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:12,487 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-08 08:22:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-08 08:22:12,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:12,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:22:12,550 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 08:22:12,560 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 08:22:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:18,464 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-08 08:22:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-08 08:22:18,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:18,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:22:18,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:22:18,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:22:18,485 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 08:22:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 17159 transitions. [2022-04-08 08:22:28,624 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 17159 transitions. Word has length 30 [2022-04-08 08:22:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:22:28,625 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 17159 transitions. [2022-04-08 08:22:28,625 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 08:22:28,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 17159 transitions. [2022-04-08 08:22:46,059 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 08:22:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 17159 transitions. [2022-04-08 08:22:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:22:46,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:22:46,068 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 08:22:46,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:22:46,068 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:22:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:22:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 1 times [2022-04-08 08:22:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:46,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377192148] [2022-04-08 08:22:46,069 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:22:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 2 times [2022-04-08 08:22:46,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:22:46,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967594853] [2022-04-08 08:22:46,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:22:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:22:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:22:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:46,092 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 08:22:46,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-08 08:22:46,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-08 08:22:46,093 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 08:22:46,094 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 08:22:46,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {572966#true} assume true; {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {572966#true} {572966#true} #200#return; {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {572966#true} call #t~ret15 := main(); {572966#true} is VALID [2022-04-08 08:22:46,094 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 08:22:46,094 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 08:22:46,094 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 08:22:46,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {572966#true} assume !(0 != ~p1~0); {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {572966#true} assume !(0 != ~p2~0); {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {572966#true} assume !(0 != ~p3~0); {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {572966#true} assume !(0 != ~p4~0); {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {572966#true} assume !(0 != ~p5~0); {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {572966#true} assume !(0 != ~p6~0); {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {572966#true} assume !(0 != ~p7~0); {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {572966#true} assume !(0 != ~p8~0); {572966#true} is VALID [2022-04-08 08:22:46,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {572966#true} assume !(0 != ~p9~0); {572966#true} is VALID [2022-04-08 08:22:46,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {572966#true} assume !(0 != ~p10~0); {572971#(= main_~p10~0 0)} is VALID [2022-04-08 08:22:46,095 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 08:22:46,095 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 08:22:46,096 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 08:22:46,096 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 08:22:46,096 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 08:22:46,097 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 08:22:46,097 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 08:22:46,100 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 08:22:46,100 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 08:22:46,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {572971#(= main_~p10~0 0)} assume 0 != ~p10~0; {572967#false} is VALID [2022-04-08 08:22:46,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {572967#false} assume 1 != ~lk10~0; {572967#false} is VALID [2022-04-08 08:22:46,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {572967#false} assume !false; {572967#false} is VALID [2022-04-08 08:22:46,101 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 08:22:46,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:22:46,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967594853] [2022-04-08 08:22:46,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967594853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:46,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:46,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:46,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:22:46,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377192148] [2022-04-08 08:22:46,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377192148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:46,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:46,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:46,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37688800] [2022-04-08 08:22:46,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:22:46,102 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 08:22:46,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:22:46,102 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 08:22:46,116 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 08:22:46,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:22:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:22:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:22:46,117 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 08:25:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:17,919 INFO L93 Difference]: Finished difference Result 42251 states and 48392 transitions. [2022-04-08 08:25:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:25:17,919 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 08:25:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:25:17,919 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 08:25:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-08 08:25:17,920 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 08:25:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-08 08:25:17,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-08 08:25:18,017 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 08:25:27,028 INFO L225 Difference]: With dead ends: 42251 [2022-04-08 08:25:27,029 INFO L226 Difference]: Without dead ends: 14601 [2022-04-08 08:25:27,054 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 08:25:27,055 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 08:25:27,055 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 08:25:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2022-04-08 08:25:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14601. [2022-04-08 08:25:28,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:25:28,210 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 08:25:28,221 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 08:25:28,233 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 08:25:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:34,548 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-08 08:25:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-08 08:25:34,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:25:34,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:25:34,574 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 08:25:34,588 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 08:25:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:40,966 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-08 08:25:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-08 08:25:40,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:25:40,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:25:40,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:25:40,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:25:40,993 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 08:25:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16135 transitions. [2022-04-08 08:25:51,124 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16135 transitions. Word has length 30 [2022-04-08 08:25:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:25:51,124 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 16135 transitions. [2022-04-08 08:25:51,124 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 08:25:51,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14601 states and 16135 transitions. [2022-04-08 08:26:07,635 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 08:26:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-08 08:26:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:26:07,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:26:07,645 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 08:26:07,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:26:07,645 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:26:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:26:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 1 times [2022-04-08 08:26:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:26:07,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1522938046] [2022-04-08 08:26:07,646 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:26:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 2 times [2022-04-08 08:26:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:26:07,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24158236] [2022-04-08 08:26:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:26:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:26:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:26:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:07,687 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 08:26:07,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-08 08:26:07,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-08 08:26:07,688 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 08:26:07,688 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 08:26:07,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {715884#true} assume true; {715884#true} is VALID [2022-04-08 08:26:07,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715884#true} {715884#true} #200#return; {715884#true} is VALID [2022-04-08 08:26:07,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {715884#true} call #t~ret15 := main(); {715884#true} is VALID [2022-04-08 08:26:07,688 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 08:26:07,688 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 08:26:07,688 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 08:26:07,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {715884#true} assume !(0 != ~p1~0); {715884#true} is VALID [2022-04-08 08:26:07,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {715884#true} assume !(0 != ~p2~0); {715884#true} is VALID [2022-04-08 08:26:07,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {715884#true} assume !(0 != ~p3~0); {715884#true} is VALID [2022-04-08 08:26:07,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {715884#true} assume !(0 != ~p4~0); {715884#true} is VALID [2022-04-08 08:26:07,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {715884#true} assume !(0 != ~p5~0); {715884#true} is VALID [2022-04-08 08:26:07,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {715884#true} assume !(0 != ~p6~0); {715884#true} is VALID [2022-04-08 08:26:07,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {715884#true} assume !(0 != ~p7~0); {715884#true} is VALID [2022-04-08 08:26:07,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {715884#true} assume !(0 != ~p8~0); {715884#true} is VALID [2022-04-08 08:26:07,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {715884#true} assume !(0 != ~p9~0); {715884#true} is VALID [2022-04-08 08:26:07,689 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 08:26:07,689 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 08:26:07,689 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 08:26:07,689 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 08:26:07,690 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 08:26:07,690 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 08:26:07,690 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 08:26:07,690 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 08:26:07,691 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 08:26:07,691 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 08:26:07,691 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 08:26:07,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {715889#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {715885#false} is VALID [2022-04-08 08:26:07,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {715885#false} assume !false; {715885#false} is VALID [2022-04-08 08:26:07,691 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 08:26:07,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:26:07,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24158236] [2022-04-08 08:26:07,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24158236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:26:07,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:26:07,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:26:07,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:26:07,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1522938046] [2022-04-08 08:26:07,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1522938046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:26:07,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:26:07,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:26:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842939069] [2022-04-08 08:26:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:26:07,692 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 08:26:07,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:26:07,694 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 08:26:07,708 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 08:26:07,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:26:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:26:07,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:26:07,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:26:07,709 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 08:26:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:19,119 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-08 08:26:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:26:19,119 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 08:26:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:26:19,119 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 08:26:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-08 08:26:19,120 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 08:26:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-08 08:26:19,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-08 08:26:19,155 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 08:26:19,155 INFO L225 Difference]: With dead ends: 14601 [2022-04-08 08:26:19,155 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 08:26:19,169 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 08:26:19,169 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 08:26:19,169 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 08:26:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 08:26:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 08:26:19,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:26:19,172 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 08:26:19,172 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 08:26:19,172 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 08:26:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:19,172 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:26:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:26:19,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:19,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:26:19,172 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 08:26:19,172 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 08:26:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:19,172 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:26:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:26:19,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:19,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:26:19,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:26:19,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:26:19,173 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 08:26:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 08:26:19,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-08 08:26:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:26:19,173 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 08:26:19,174 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 08:26:19,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 08:26:19,174 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 08:26:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:26:19,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:19,176 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:26:19,177 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 08:26:19,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 08:26:50,167 WARN L232 SmtUtils]: Spent 30.95s 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 08:27:51,332 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 08:29:57,133 WARN L232 SmtUtils]: Spent 2.10m 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 08:30:04,010 WARN L232 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 570 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:30:54,954 WARN L232 SmtUtils]: Spent 50.94s on a formula simplification that was a NOOP. DAG size: 1126 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:31:14,325 WARN L232 SmtUtils]: Spent 19.37s on a formula simplification that was a NOOP. DAG size: 1081 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:31:37,069 WARN L232 SmtUtils]: Spent 22.74s on a formula simplification that was a NOOP. DAG size: 950 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)