/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_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:19:04,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:19:04,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:19:04,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:19:04,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:19:04,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:19:04,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:19:04,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:19:04,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:19:04,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:19:04,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:19:04,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:19:04,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:19:04,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:19:04,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:19:04,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:19:04,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:19:04,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:19:04,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:19:04,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:19:04,237 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:19:04,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:19:04,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:19:04,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:19:04,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:19:04,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:19:04,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:19:04,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:19:04,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:19:04,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:19:04,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:19:04,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:19:04,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:19:04,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:19:04,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:19:04,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:19:04,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:19:04,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:19:04,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:19:04,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:19:04,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:19:04,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:19:04,252 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:19:04,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:19:04,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:19:04,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:19:04,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:19:04,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:19:04,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:19:04,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:19:04,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:19:04,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:19:04,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:19:04,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:19:04,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:19:04,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:19:04,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:19:04,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:19:04,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:19:04,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:19:04,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:19:04,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:19:04,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:19:04,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:19:04,262 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:19:04,262 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:19:04,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:19:04,262 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:19:04,262 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:19:04,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:19:04,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:19:04,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:19:04,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:19:04,479 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:19:04,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-08 08:19:04,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc418631a/ba1a094d98c3441998db8eb661fd7b67/FLAGf1555d6cd [2022-04-08 08:19:04,847 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:19:04,848 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-08 08:19:04,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc418631a/ba1a094d98c3441998db8eb661fd7b67/FLAGf1555d6cd [2022-04-08 08:19:05,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc418631a/ba1a094d98c3441998db8eb661fd7b67 [2022-04-08 08:19:05,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:19:05,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:19:05,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:19:05,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:19:05,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:19:05,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3ba42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05, skipping insertion in model container [2022-04-08 08:19:05,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:19:05,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:19:05,548 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_15-2.c[5628,5641] [2022-04-08 08:19:05,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:19:05,556 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:19:05,586 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_15-2.c[5628,5641] [2022-04-08 08:19:05,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:19:05,597 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:19:05,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05 WrapperNode [2022-04-08 08:19:05,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:19:05,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:19:05,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:19:05,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:19:05,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:19:05,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:19:05,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:19:05,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:19:05,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (1/1) ... [2022-04-08 08:19:05,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:19:05,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:19:05,661 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:19:05,687 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:19:05,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:19:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:19:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:19:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:19:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:19:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:19:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:19:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:19:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:19:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:19:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:19:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:19:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:19:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:19:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:19:05,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:19:05,766 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:19:05,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:19:05,992 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:19:05,997 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:19:05,997 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:19:05,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:19:05 BoogieIcfgContainer [2022-04-08 08:19:05,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:19:05,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:19:05,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:19:06,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:19:06,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:19:05" (1/3) ... [2022-04-08 08:19:06,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5696a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:19:06, skipping insertion in model container [2022-04-08 08:19:06,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:05" (2/3) ... [2022-04-08 08:19:06,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5696a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:19:06, skipping insertion in model container [2022-04-08 08:19:06,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:19:05" (3/3) ... [2022-04-08 08:19:06,020 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2022-04-08 08:19:06,023 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:19:06,023 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:19:06,061 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:19:06,066 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:19:06,066 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:19:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 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:19:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:19:06,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:06,092 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:19:06,092 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 1 times [2022-04-08 08:19:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:06,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2101501333] [2022-04-08 08:19:06,107 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:06,108 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 2 times [2022-04-08 08:19:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:06,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950407156] [2022-04-08 08:19:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:06,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(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(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-08 08:19:06,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-08 08:19:06,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-08 08:19:06,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:06,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(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(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-08 08:19:06,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-08 08:19:06,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-08 08:19:06,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret20 := main(); {63#true} is VALID [2022-04-08 08:19:06,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {63#true} is VALID [2022-04-08 08:19:06,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {63#true} is VALID [2022-04-08 08:19:06,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {63#true} is VALID [2022-04-08 08:19:06,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} assume 0 != ~p1~0;~lk1~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p1~0; {68#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:06,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {64#false} is VALID [2022-04-08 08:19:06,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-04-08 08:19:06,389 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:06,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:06,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950407156] [2022-04-08 08:19:06,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950407156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:06,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:06,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:06,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2101501333] [2022-04-08 08:19:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2101501333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:06,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:06,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963787631] [2022-04-08 08:19:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:06,400 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:19:06,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:06,404 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:19:06,435 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:19:06,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:06,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:06,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:06,456 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 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 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:19:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:06,779 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-04-08 08:19:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:06,780 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:19:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:06,781 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:19:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 08:19:06,788 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:19:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 08:19:06,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-08 08:19:06,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:06,989 INFO L225 Difference]: With dead ends: 118 [2022-04-08 08:19:06,989 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 08:19:06,991 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:07,001 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:07,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 119 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 08:19:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-08 08:19:07,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:07,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have 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,080 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have 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,080 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have 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,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:07,097 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-08 08:19:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-08 08:19:07,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:07,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:07,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 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 103 states. [2022-04-08 08:19:07,098 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 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 103 states. [2022-04-08 08:19:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:07,103 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-08 08:19:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-08 08:19:07,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:07,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:07,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:07,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have 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,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-08 08:19:07,108 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-08 08:19:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:07,109 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-08 08:19:07,109 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:19:07,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 130 transitions. [2022-04-08 08:19:07,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-08 08:19:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:19:07,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:07,218 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:19:07,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:19:07,218 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 1 times [2022-04-08 08:19:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:07,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [742456380] [2022-04-08 08:19:07,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 2 times [2022-04-08 08:19:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:07,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190173255] [2022-04-08 08:19:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:07,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#(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(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-08 08:19:07,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 08:19:07,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-08 08:19:07,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:07,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#(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(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-08 08:19:07,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 08:19:07,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-08 08:19:07,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret20 := main(); {659#true} is VALID [2022-04-08 08:19:07,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {659#true} is VALID [2022-04-08 08:19:07,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {659#true} is VALID [2022-04-08 08:19:07,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {659#true} is VALID [2022-04-08 08:19:07,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 != ~p1~0); {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p2~0); {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(= main_~p1~0 0)} assume !(0 != ~p10~0); {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {664#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:07,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#(= main_~p1~0 0)} assume 0 != ~p1~0; {660#false} is VALID [2022-04-08 08:19:07,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {660#false} assume 1 != ~lk1~0; {660#false} is VALID [2022-04-08 08:19:07,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-08 08:19:07,292 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:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:07,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190173255] [2022-04-08 08:19:07,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190173255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:07,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:07,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:07,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:07,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [742456380] [2022-04-08 08:19:07,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [742456380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:07,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:07,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721041439] [2022-04-08 08:19:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:07,294 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:19:07,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:07,294 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:19:07,310 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:19:07,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:07,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:07,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:07,311 INFO L87 Difference]: Start difference. First operand 71 states and 130 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:19:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:07,577 INFO L93 Difference]: Finished difference Result 168 states and 313 transitions. [2022-04-08 08:19:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:07,577 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:19:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:07,578 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:19:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-08 08:19:07,580 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:19:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-08 08:19:07,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 282 transitions. [2022-04-08 08:19:07,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:07,741 INFO L225 Difference]: With dead ends: 168 [2022-04-08 08:19:07,741 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 08:19:07,742 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:07,743 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:07,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 135 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 08:19:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-08 08:19:07,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:07,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have 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,768 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have 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,768 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have 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,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:07,771 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-08 08:19:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-08 08:19:07,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:07,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:07,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 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 103 states. [2022-04-08 08:19:07,773 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 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 103 states. [2022-04-08 08:19:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:07,775 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-08 08:19:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-08 08:19:07,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:07,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:07,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:07,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have 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,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2022-04-08 08:19:07,779 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2022-04-08 08:19:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:07,779 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2022-04-08 08:19:07,780 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:19:07,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 186 transitions. [2022-04-08 08:19:07,906 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:19:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2022-04-08 08:19:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:19:07,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:07,907 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:19:07,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:19:07,908 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:07,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 1 times [2022-04-08 08:19:07,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:07,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876123080] [2022-04-08 08:19:07,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 2 times [2022-04-08 08:19:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:07,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221744797] [2022-04-08 08:19:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:07,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:07,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#(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(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-08 08:19:07,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-08 08:19:07,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-08 08:19:07,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {1415#true} call ULTIMATE.init(); {1421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:07,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#(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(18, 2);call #Ultimate.allocInit(12, 3); {1415#true} is VALID [2022-04-08 08:19:07,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-04-08 08:19:07,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1415#true} {1415#true} #285#return; {1415#true} is VALID [2022-04-08 08:19:07,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {1415#true} call #t~ret20 := main(); {1415#true} is VALID [2022-04-08 08:19:07,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {1415#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {1415#true} is VALID [2022-04-08 08:19:07,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {1415#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {1415#true} is VALID [2022-04-08 08:19:07,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {1415#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1415#true} is VALID [2022-04-08 08:19:07,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#true} assume 0 != ~p1~0;~lk1~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {1420#(not (= main_~p1~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {1420#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:07,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {1420#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1416#false} is VALID [2022-04-08 08:19:07,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {1416#false} assume 0 != ~p2~0; {1416#false} is VALID [2022-04-08 08:19:07,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {1416#false} assume 1 != ~lk2~0; {1416#false} is VALID [2022-04-08 08:19:07,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2022-04-08 08:19:07,962 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:07,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:07,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221744797] [2022-04-08 08:19:07,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221744797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:07,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:07,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:07,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:07,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876123080] [2022-04-08 08:19:07,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876123080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:07,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:07,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847465608] [2022-04-08 08:19:07,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:07,964 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:19:07,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:07,964 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:19:07,980 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:19:07,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:07,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:07,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:07,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:07,980 INFO L87 Difference]: Start difference. First operand 101 states and 186 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:19:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:08,184 INFO L93 Difference]: Finished difference Result 154 states and 280 transitions. [2022-04-08 08:19:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:08,184 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:19:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:08,184 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:19:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-08 08:19:08,187 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:19:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-08 08:19:08,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 277 transitions. [2022-04-08 08:19:08,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:08,352 INFO L225 Difference]: With dead ends: 154 [2022-04-08 08:19:08,352 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 08:19:08,353 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:08,353 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:08,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 163 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 08:19:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-08 08:19:08,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:08,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have 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:08,400 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have 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:08,400 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have 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:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:08,403 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-08 08:19:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-08 08:19:08,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:08,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:08,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 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 106 states. [2022-04-08 08:19:08,405 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 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 106 states. [2022-04-08 08:19:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:08,408 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-08 08:19:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-08 08:19:08,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:08,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:08,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:08,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have 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:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-08 08:19:08,426 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2022-04-08 08:19:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:08,426 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-08 08:19:08,426 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:19:08,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 188 transitions. [2022-04-08 08:19:08,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-08 08:19:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:19:08,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:08,638 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:19:08,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:19:08,639 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 1 times [2022-04-08 08:19:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:08,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [585160604] [2022-04-08 08:19:08,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 2 times [2022-04-08 08:19:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:08,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914123583] [2022-04-08 08:19:08,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:08,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {2161#(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(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-08 08:19:08,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 08:19:08,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-08 08:19:08,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:08,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2161#(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(18, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-08 08:19:08,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 08:19:08,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #285#return; {2155#true} is VALID [2022-04-08 08:19:08,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret20 := main(); {2155#true} is VALID [2022-04-08 08:19:08,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {2155#true} is VALID [2022-04-08 08:19:08,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {2155#true} is VALID [2022-04-08 08:19:08,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {2155#true} is VALID [2022-04-08 08:19:08,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 != ~p1~0); {2155#true} is VALID [2022-04-08 08:19:08,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume !(0 != ~p2~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2160#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:08,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {2160#(= main_~p2~0 0)} assume 0 != ~p2~0; {2156#false} is VALID [2022-04-08 08:19:08,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {2156#false} assume 1 != ~lk2~0; {2156#false} is VALID [2022-04-08 08:19:08,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-08 08:19:08,743 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:08,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:08,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914123583] [2022-04-08 08:19:08,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914123583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:08,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:08,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:08,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [585160604] [2022-04-08 08:19:08,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [585160604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:08,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:08,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:08,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127216316] [2022-04-08 08:19:08,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:08,744 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:19:08,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:08,745 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:19:08,761 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:19:08,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:08,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:08,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:08,762 INFO L87 Difference]: Start difference. First operand 104 states and 188 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:19:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:08,999 INFO L93 Difference]: Finished difference Result 292 states and 540 transitions. [2022-04-08 08:19:08,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:09,000 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:19:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:09,000 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:19:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-08 08:19:09,003 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:19:09,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-08 08:19:09,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 280 transitions. [2022-04-08 08:19:09,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:09,197 INFO L225 Difference]: With dead ends: 292 [2022-04-08 08:19:09,197 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 08:19:09,198 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:09,198 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 248 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:09,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 109 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 08:19:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-08 08:19:09,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:09,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have 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:09,211 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have 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:09,212 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have 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:09,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:09,216 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-08 08:19:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-08 08:19:09,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:09,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:09,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 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 197 states. [2022-04-08 08:19:09,217 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 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 197 states. [2022-04-08 08:19:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:09,222 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-08 08:19:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-08 08:19:09,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:09,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:09,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:09,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have 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:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2022-04-08 08:19:09,228 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2022-04-08 08:19:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:09,228 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2022-04-08 08:19:09,228 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:19:09,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 357 transitions. [2022-04-08 08:19:09,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2022-04-08 08:19:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:19:09,465 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:09,465 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:19:09,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:19:09,466 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 1 times [2022-04-08 08:19:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:09,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [218433672] [2022-04-08 08:19:09,466 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 2 times [2022-04-08 08:19:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:09,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219068817] [2022-04-08 08:19:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:09,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:09,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {3541#(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(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-08 08:19:09,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-08 08:19:09,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-08 08:19:09,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {3535#true} call ULTIMATE.init(); {3541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:09,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#(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(18, 2);call #Ultimate.allocInit(12, 3); {3535#true} is VALID [2022-04-08 08:19:09,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {3535#true} assume true; {3535#true} is VALID [2022-04-08 08:19:09,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3535#true} {3535#true} #285#return; {3535#true} is VALID [2022-04-08 08:19:09,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {3535#true} call #t~ret20 := main(); {3535#true} is VALID [2022-04-08 08:19:09,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {3535#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {3535#true} is VALID [2022-04-08 08:19:09,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {3535#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {3535#true} is VALID [2022-04-08 08:19:09,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {3535#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {3535#true} is VALID [2022-04-08 08:19:09,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {3535#true} assume !(0 != ~p1~0); {3535#true} is VALID [2022-04-08 08:19:09,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {3535#true} assume 0 != ~p2~0;~lk2~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {3540#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {3540#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3540#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:09,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {3540#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3536#false} is VALID [2022-04-08 08:19:09,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#false} assume !false; {3536#false} is VALID [2022-04-08 08:19:09,541 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:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:09,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219068817] [2022-04-08 08:19:09,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219068817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:09,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:09,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:09,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:09,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [218433672] [2022-04-08 08:19:09,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [218433672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:09,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:09,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:09,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673177387] [2022-04-08 08:19:09,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:09,542 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:19:09,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:09,543 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:19:09,563 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:19:09,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:09,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:09,564 INFO L87 Difference]: Start difference. First operand 195 states and 357 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:19:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:09,768 INFO L93 Difference]: Finished difference Result 255 states and 467 transitions. [2022-04-08 08:19:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:09,768 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:19:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:09,768 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:19:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 08:19:09,770 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:19:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 08:19:09,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-08 08:19:09,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:09,894 INFO L225 Difference]: With dead ends: 255 [2022-04-08 08:19:09,894 INFO L226 Difference]: Without dead ends: 253 [2022-04-08 08:19:09,904 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:09,904 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:09,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-08 08:19:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2022-04-08 08:19:09,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:09,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have 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:09,917 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have 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:09,917 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have 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:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:09,923 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-08 08:19:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-08 08:19:09,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:09,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:09,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 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 253 states. [2022-04-08 08:19:09,924 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 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 253 states. [2022-04-08 08:19:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:09,929 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-08 08:19:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-08 08:19:09,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:09,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:09,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:09,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have 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:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2022-04-08 08:19:09,935 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2022-04-08 08:19:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:09,935 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2022-04-08 08:19:09,935 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:19:09,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 355 transitions. [2022-04-08 08:19:10,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2022-04-08 08:19:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:19:10,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:10,218 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:19:10,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:19:10,218 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 1 times [2022-04-08 08:19:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:10,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1575173718] [2022-04-08 08:19:10,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 2 times [2022-04-08 08:19:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:10,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023542991] [2022-04-08 08:19:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:10,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:10,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {4959#(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(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-08 08:19:10,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-08 08:19:10,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-08 08:19:10,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {4953#true} call ULTIMATE.init(); {4959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:10,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {4959#(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(18, 2);call #Ultimate.allocInit(12, 3); {4953#true} is VALID [2022-04-08 08:19:10,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {4953#true} assume true; {4953#true} is VALID [2022-04-08 08:19:10,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4953#true} {4953#true} #285#return; {4953#true} is VALID [2022-04-08 08:19:10,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {4953#true} call #t~ret20 := main(); {4953#true} is VALID [2022-04-08 08:19:10,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {4953#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {4953#true} is VALID [2022-04-08 08:19:10,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {4953#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {4953#true} is VALID [2022-04-08 08:19:10,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {4953#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {4953#true} is VALID [2022-04-08 08:19:10,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {4953#true} assume !(0 != ~p1~0); {4953#true} is VALID [2022-04-08 08:19:10,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {4953#true} assume !(0 != ~p2~0); {4953#true} is VALID [2022-04-08 08:19:10,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {4953#true} assume 0 != ~p3~0;~lk3~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {4958#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {4958#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4958#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:10,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {4958#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4954#false} is VALID [2022-04-08 08:19:10,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {4954#false} assume !false; {4954#false} is VALID [2022-04-08 08:19:10,304 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:10,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:10,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023542991] [2022-04-08 08:19:10,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023542991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:10,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:10,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:10,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:10,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1575173718] [2022-04-08 08:19:10,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1575173718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:10,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:10,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826717558] [2022-04-08 08:19:10,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:10,305 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:19:10,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:10,305 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:19:10,346 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:19:10,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:10,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:10,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:10,348 INFO L87 Difference]: Start difference. First operand 195 states and 355 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:19:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:10,552 INFO L93 Difference]: Finished difference Result 371 states and 683 transitions. [2022-04-08 08:19:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:10,552 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:19:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:10,552 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:19:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 08:19:10,554 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:19:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 08:19:10,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-08 08:19:10,676 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:19:10,682 INFO L225 Difference]: With dead ends: 371 [2022-04-08 08:19:10,682 INFO L226 Difference]: Without dead ends: 369 [2022-04-08 08:19:10,682 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,683 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 239 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:10,683 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-08 08:19:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2022-04-08 08:19:10,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:10,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have 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,699 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have 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,700 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have 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,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:10,706 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-08 08:19:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-08 08:19:10,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:10,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:10,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 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 369 states. [2022-04-08 08:19:10,707 INFO L87 Difference]: Start difference. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 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 369 states. [2022-04-08 08:19:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:10,713 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-08 08:19:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-08 08:19:10,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:10,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:10,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:10,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have 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,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2022-04-08 08:19:10,718 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2022-04-08 08:19:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:10,719 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2022-04-08 08:19:10,719 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:19:10,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 263 states and 477 transitions. [2022-04-08 08:19:11,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2022-04-08 08:19:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:19:11,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:11,125 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:19:11,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:19:11,126 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 1 times [2022-04-08 08:19:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:11,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159934113] [2022-04-08 08:19:11,126 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 2 times [2022-04-08 08:19:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:11,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447603859] [2022-04-08 08:19:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:11,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:11,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {6977#(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(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-08 08:19:11,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-08 08:19:11,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-08 08:19:11,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {6971#true} call ULTIMATE.init(); {6977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:11,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {6977#(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(18, 2);call #Ultimate.allocInit(12, 3); {6971#true} is VALID [2022-04-08 08:19:11,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {6971#true} assume true; {6971#true} is VALID [2022-04-08 08:19:11,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6971#true} {6971#true} #285#return; {6971#true} is VALID [2022-04-08 08:19:11,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {6971#true} call #t~ret20 := main(); {6971#true} is VALID [2022-04-08 08:19:11,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {6971#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {6971#true} is VALID [2022-04-08 08:19:11,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {6971#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {6971#true} is VALID [2022-04-08 08:19:11,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {6971#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {6971#true} is VALID [2022-04-08 08:19:11,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {6971#true} assume !(0 != ~p1~0); {6971#true} is VALID [2022-04-08 08:19:11,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {6971#true} assume !(0 != ~p2~0); {6971#true} is VALID [2022-04-08 08:19:11,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {6971#true} assume !(0 != ~p3~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {6976#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6976#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:11,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {6976#(= main_~p3~0 0)} assume 0 != ~p3~0; {6972#false} is VALID [2022-04-08 08:19:11,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {6972#false} assume 1 != ~lk3~0; {6972#false} is VALID [2022-04-08 08:19:11,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {6972#false} assume !false; {6972#false} is VALID [2022-04-08 08:19:11,168 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:11,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:11,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447603859] [2022-04-08 08:19:11,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447603859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:11,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:11,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:11,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:11,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159934113] [2022-04-08 08:19:11,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159934113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:11,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:11,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669030038] [2022-04-08 08:19:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:11,169 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:19:11,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:11,169 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:19:11,183 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:19:11,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:11,183 INFO L87 Difference]: Start difference. First operand 263 states and 477 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:19:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,386 INFO L93 Difference]: Finished difference Result 631 states and 1155 transitions. [2022-04-08 08:19:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:11,386 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:19:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:11,386 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:19:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-08 08:19:11,388 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:19:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-08 08:19:11,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 276 transitions. [2022-04-08 08:19:11,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:11,565 INFO L225 Difference]: With dead ends: 631 [2022-04-08 08:19:11,565 INFO L226 Difference]: Without dead ends: 377 [2022-04-08 08:19:11,566 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:11,567 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:11,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-08 08:19:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-04-08 08:19:11,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:11,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have 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:11,586 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have 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:11,587 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have 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:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,593 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-08 08:19:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-08 08:19:11,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:11,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:11,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 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 377 states. [2022-04-08 08:19:11,595 INFO L87 Difference]: Start difference. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 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 377 states. [2022-04-08 08:19:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:11,601 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-08 08:19:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-08 08:19:11,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:11,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:11,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:11,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have 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:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2022-04-08 08:19:11,610 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2022-04-08 08:19:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:11,610 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2022-04-08 08:19:11,610 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:19:11,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 679 transitions. [2022-04-08 08:19:12,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2022-04-08 08:19:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:19:12,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:12,208 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:12,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:19:12,208 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 1 times [2022-04-08 08:19:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:12,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072339478] [2022-04-08 08:19:12,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 2 times [2022-04-08 08:19:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:12,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610013645] [2022-04-08 08:19:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:12,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {9755#(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(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-08 08:19:12,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-08 08:19:12,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-08 08:19:12,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {9749#true} call ULTIMATE.init(); {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:12,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {9755#(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(18, 2);call #Ultimate.allocInit(12, 3); {9749#true} is VALID [2022-04-08 08:19:12,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {9749#true} assume true; {9749#true} is VALID [2022-04-08 08:19:12,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9749#true} {9749#true} #285#return; {9749#true} is VALID [2022-04-08 08:19:12,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {9749#true} call #t~ret20 := main(); {9749#true} is VALID [2022-04-08 08:19:12,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {9749#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {9749#true} is VALID [2022-04-08 08:19:12,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {9749#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {9749#true} is VALID [2022-04-08 08:19:12,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {9749#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {9749#true} is VALID [2022-04-08 08:19:12,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {9749#true} assume !(0 != ~p1~0); {9749#true} is VALID [2022-04-08 08:19:12,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {9749#true} assume !(0 != ~p2~0); {9749#true} is VALID [2022-04-08 08:19:12,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {9749#true} assume 0 != ~p3~0;~lk3~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {9754#(not (= main_~p3~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9754#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:12,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {9754#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9750#false} is VALID [2022-04-08 08:19:12,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {9750#false} assume 0 != ~p4~0; {9750#false} is VALID [2022-04-08 08:19:12,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {9750#false} assume 1 != ~lk4~0; {9750#false} is VALID [2022-04-08 08:19:12,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {9750#false} assume !false; {9750#false} is VALID [2022-04-08 08:19:12,250 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:12,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610013645] [2022-04-08 08:19:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610013645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:12,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:12,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:12,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072339478] [2022-04-08 08:19:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072339478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:12,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:12,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470107188] [2022-04-08 08:19:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:12,251 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:12,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:12,251 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:12,265 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:12,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:12,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:12,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:12,266 INFO L87 Difference]: Start difference. First operand 375 states and 679 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:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,469 INFO L93 Difference]: Finished difference Result 565 states and 1021 transitions. [2022-04-08 08:19:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:12,469 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:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:12,470 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:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-08 08:19:12,471 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:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-08 08:19:12,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 271 transitions. [2022-04-08 08:19:12,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:12,640 INFO L225 Difference]: With dead ends: 565 [2022-04-08 08:19:12,640 INFO L226 Difference]: Without dead ends: 383 [2022-04-08 08:19:12,641 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:12,642 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:12,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-08 08:19:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2022-04-08 08:19:12,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:12,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have 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,675 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have 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,676 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have 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,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,682 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-08 08:19:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-08 08:19:12,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 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 383 states. [2022-04-08 08:19:12,684 INFO L87 Difference]: Start difference. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 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 383 states. [2022-04-08 08:19:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:12,690 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-08 08:19:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-08 08:19:12,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:12,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:12,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:12,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have 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,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2022-04-08 08:19:12,699 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2022-04-08 08:19:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:12,699 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2022-04-08 08:19:12,700 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:12,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 683 transitions. [2022-04-08 08:19:13,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2022-04-08 08:19:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:19:13,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:13,283 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:13,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:19:13,284 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 1 times [2022-04-08 08:19:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:13,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678702761] [2022-04-08 08:19:13,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 2 times [2022-04-08 08:19:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:13,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729561214] [2022-04-08 08:19:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:13,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {12425#(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(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-08 08:19:13,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-08 08:19:13,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-08 08:19:13,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {12419#true} call ULTIMATE.init(); {12425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:13,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {12425#(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(18, 2);call #Ultimate.allocInit(12, 3); {12419#true} is VALID [2022-04-08 08:19:13,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {12419#true} assume true; {12419#true} is VALID [2022-04-08 08:19:13,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12419#true} {12419#true} #285#return; {12419#true} is VALID [2022-04-08 08:19:13,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {12419#true} call #t~ret20 := main(); {12419#true} is VALID [2022-04-08 08:19:13,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {12419#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {12419#true} is VALID [2022-04-08 08:19:13,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {12419#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {12419#true} is VALID [2022-04-08 08:19:13,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {12419#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {12419#true} is VALID [2022-04-08 08:19:13,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {12419#true} assume !(0 != ~p1~0); {12419#true} is VALID [2022-04-08 08:19:13,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {12419#true} assume !(0 != ~p2~0); {12419#true} is VALID [2022-04-08 08:19:13,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {12419#true} assume !(0 != ~p3~0); {12419#true} is VALID [2022-04-08 08:19:13,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {12419#true} assume 0 != ~p4~0;~lk4~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {12424#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {12424#(= main_~lk4~0 1)} assume 0 != ~p4~0; {12424#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:13,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {12424#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {12420#false} is VALID [2022-04-08 08:19:13,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {12420#false} assume !false; {12420#false} is VALID [2022-04-08 08:19:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:13,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729561214] [2022-04-08 08:19:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729561214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:13,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:13,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678702761] [2022-04-08 08:19:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678702761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:13,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977400185] [2022-04-08 08:19:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:13,330 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:13,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:13,330 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:13,346 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:13,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:13,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:13,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:13,346 INFO L87 Difference]: Start difference. First operand 381 states and 683 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:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,638 INFO L93 Difference]: Finished difference Result 717 states and 1301 transitions. [2022-04-08 08:19:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:13,638 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:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:13,638 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:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-08 08:19:13,640 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:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-08 08:19:13,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-04-08 08:19:13,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,790 INFO L225 Difference]: With dead ends: 717 [2022-04-08 08:19:13,790 INFO L226 Difference]: Without dead ends: 715 [2022-04-08 08:19:13,790 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:13,791 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:13,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-08 08:19:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2022-04-08 08:19:13,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:13,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have 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:13,817 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have 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:13,818 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have 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:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,840 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-08 08:19:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-08 08:19:13,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 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 715 states. [2022-04-08 08:19:13,843 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 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 715 states. [2022-04-08 08:19:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,859 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-08 08:19:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-08 08:19:13,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:13,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have 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:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2022-04-08 08:19:13,875 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2022-04-08 08:19:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:13,875 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2022-04-08 08:19:13,875 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:13,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 923 transitions. [2022-04-08 08:19:14,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2022-04-08 08:19:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:19:14,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:14,835 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:14,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:19:14,835 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 1 times [2022-04-08 08:19:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543973574] [2022-04-08 08:19:14,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 2 times [2022-04-08 08:19:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:14,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337406343] [2022-04-08 08:19:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:14,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {16343#(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(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-08 08:19:14,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-08 08:19:14,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {16337#true} call ULTIMATE.init(); {16343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:14,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {16343#(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(18, 2);call #Ultimate.allocInit(12, 3); {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {16337#true} assume true; {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16337#true} {16337#true} #285#return; {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {16337#true} call #t~ret20 := main(); {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {16337#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {16337#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {16337#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {16337#true} assume !(0 != ~p1~0); {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {16337#true} assume !(0 != ~p2~0); {16337#true} is VALID [2022-04-08 08:19:14,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {16337#true} assume !(0 != ~p3~0); {16337#true} is VALID [2022-04-08 08:19:14,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {16337#true} assume !(0 != ~p4~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p10~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p1~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p2~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {16342#(= main_~p4~0 0)} assume !(0 != ~p3~0); {16342#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:14,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {16342#(= main_~p4~0 0)} assume 0 != ~p4~0; {16338#false} is VALID [2022-04-08 08:19:14,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {16338#false} assume 1 != ~lk4~0; {16338#false} is VALID [2022-04-08 08:19:14,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {16338#false} assume !false; {16338#false} is VALID [2022-04-08 08:19:14,899 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:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337406343] [2022-04-08 08:19:14,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337406343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:14,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:14,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:14,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543973574] [2022-04-08 08:19:14,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543973574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:14,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:14,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431450138] [2022-04-08 08:19:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:14,900 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:14,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:14,900 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:14,919 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:14,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:14,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:14,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:14,920 INFO L87 Difference]: Start difference. First operand 521 states and 923 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:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:15,239 INFO L93 Difference]: Finished difference Result 1245 states and 2221 transitions. [2022-04-08 08:19:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:15,239 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:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:15,239 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:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-08 08:19:15,241 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:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-08 08:19:15,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 273 transitions. [2022-04-08 08:19:15,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:15,441 INFO L225 Difference]: With dead ends: 1245 [2022-04-08 08:19:15,441 INFO L226 Difference]: Without dead ends: 739 [2022-04-08 08:19:15,442 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:15,442 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:15,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 141 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-04-08 08:19:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-04-08 08:19:15,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:15,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:15,482 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:15,484 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:15,502 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-08 08:19:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-08 08:19:15,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:15,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:15,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 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 739 states. [2022-04-08 08:19:15,506 INFO L87 Difference]: Start difference. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 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 739 states. [2022-04-08 08:19:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:15,524 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-08 08:19:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-08 08:19:15,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:15,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:15,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:15,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2022-04-08 08:19:15,589 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2022-04-08 08:19:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:15,589 INFO L478 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2022-04-08 08:19:15,589 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:15,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 737 states and 1303 transitions. [2022-04-08 08:19:16,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2022-04-08 08:19:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:19:16,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:16,712 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:19:16,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:19:16,713 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 1 times [2022-04-08 08:19:16,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:16,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144134347] [2022-04-08 08:19:16,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 2 times [2022-04-08 08:19:16,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:16,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560071347] [2022-04-08 08:19:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:16,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {21797#(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(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-08 08:19:16,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-08 08:19:16,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-08 08:19:16,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {21791#true} call ULTIMATE.init(); {21797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:16,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {21797#(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(18, 2);call #Ultimate.allocInit(12, 3); {21791#true} is VALID [2022-04-08 08:19:16,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {21791#true} assume true; {21791#true} is VALID [2022-04-08 08:19:16,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21791#true} {21791#true} #285#return; {21791#true} is VALID [2022-04-08 08:19:16,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {21791#true} call #t~ret20 := main(); {21791#true} is VALID [2022-04-08 08:19:16,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {21791#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {21791#true} is VALID [2022-04-08 08:19:16,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {21791#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {21791#true} is VALID [2022-04-08 08:19:16,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {21791#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {21791#true} is VALID [2022-04-08 08:19:16,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {21791#true} assume !(0 != ~p1~0); {21791#true} is VALID [2022-04-08 08:19:16,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {21791#true} assume !(0 != ~p2~0); {21791#true} is VALID [2022-04-08 08:19:16,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {21791#true} assume !(0 != ~p3~0); {21791#true} is VALID [2022-04-08 08:19:16,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {21791#true} assume 0 != ~p4~0;~lk4~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {21796#(not (= main_~p4~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {21796#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:16,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {21796#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {21792#false} is VALID [2022-04-08 08:19:16,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {21792#false} assume 0 != ~p5~0; {21792#false} is VALID [2022-04-08 08:19:16,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {21792#false} assume 1 != ~lk5~0; {21792#false} is VALID [2022-04-08 08:19:16,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {21792#false} assume !false; {21792#false} is VALID [2022-04-08 08:19:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560071347] [2022-04-08 08:19:16,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560071347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:16,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:16,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:16,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144134347] [2022-04-08 08:19:16,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144134347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:16,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:16,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85427813] [2022-04-08 08:19:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:16,811 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:19:16,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:16,812 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:19:16,827 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:19:16,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:16,828 INFO L87 Difference]: Start difference. First operand 737 states and 1303 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:19:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:17,103 INFO L93 Difference]: Finished difference Result 1105 states and 1949 transitions. [2022-04-08 08:19:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:17,103 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:19:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:17,103 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:19:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-08 08:19:17,106 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:19:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-08 08:19:17,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 268 transitions. [2022-04-08 08:19:17,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:17,289 INFO L225 Difference]: With dead ends: 1105 [2022-04-08 08:19:17,289 INFO L226 Difference]: Without dead ends: 747 [2022-04-08 08:19:17,290 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:17,290 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:17,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 154 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-08 08:19:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2022-04-08 08:19:17,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:17,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:17,360 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:17,361 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:17,380 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-08 08:19:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-08 08:19:17,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:17,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:17,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 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 747 states. [2022-04-08 08:19:17,383 INFO L87 Difference]: Start difference. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 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 747 states. [2022-04-08 08:19:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:17,402 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-08 08:19:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-08 08:19:17,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:17,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:17,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:17,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have 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:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2022-04-08 08:19:17,428 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2022-04-08 08:19:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:17,428 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2022-04-08 08:19:17,428 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:19:17,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1303 transitions. [2022-04-08 08:19:18,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1303 edges. 1303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2022-04-08 08:19:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:19:18,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:18,596 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:18,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:19:18,597 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 1 times [2022-04-08 08:19:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:18,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3724422] [2022-04-08 08:19:18,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 2 times [2022-04-08 08:19:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:18,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976186573] [2022-04-08 08:19:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:18,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {27003#(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(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-08 08:19:18,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-08 08:19:18,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-08 08:19:18,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {26997#true} call ULTIMATE.init(); {27003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:18,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {27003#(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(18, 2);call #Ultimate.allocInit(12, 3); {26997#true} is VALID [2022-04-08 08:19:18,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {26997#true} assume true; {26997#true} is VALID [2022-04-08 08:19:18,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26997#true} {26997#true} #285#return; {26997#true} is VALID [2022-04-08 08:19:18,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {26997#true} call #t~ret20 := main(); {26997#true} is VALID [2022-04-08 08:19:18,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {26997#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {26997#true} is VALID [2022-04-08 08:19:18,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {26997#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {26997#true} is VALID [2022-04-08 08:19:18,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {26997#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {26997#true} is VALID [2022-04-08 08:19:18,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {26997#true} assume !(0 != ~p1~0); {26997#true} is VALID [2022-04-08 08:19:18,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {26997#true} assume !(0 != ~p2~0); {26997#true} is VALID [2022-04-08 08:19:18,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {26997#true} assume !(0 != ~p3~0); {26997#true} is VALID [2022-04-08 08:19:18,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {26997#true} assume !(0 != ~p4~0); {26997#true} is VALID [2022-04-08 08:19:18,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {26997#true} assume 0 != ~p5~0;~lk5~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {27002#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {27002#(= main_~lk5~0 1)} assume 0 != ~p5~0; {27002#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:18,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {27002#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {26998#false} is VALID [2022-04-08 08:19:18,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {26998#false} assume !false; {26998#false} is VALID [2022-04-08 08:19:18,655 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:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:18,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976186573] [2022-04-08 08:19:18,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976186573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:18,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:18,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:18,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:18,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3724422] [2022-04-08 08:19:18,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3724422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:18,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:18,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:18,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125109894] [2022-04-08 08:19:18,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:18,656 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:19:18,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:18,656 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:19:18,675 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:19:18,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:18,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:18,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:18,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:18,676 INFO L87 Difference]: Start difference. First operand 745 states and 1303 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:19:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:19,051 INFO L93 Difference]: Finished difference Result 1389 states and 2465 transitions. [2022-04-08 08:19:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:19,051 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:19:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:19,051 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:19:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 08:19:19,053 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:19:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 08:19:19,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-08 08:19:19,198 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:19:19,270 INFO L225 Difference]: With dead ends: 1389 [2022-04-08 08:19:19,270 INFO L226 Difference]: Without dead ends: 1387 [2022-04-08 08:19:19,271 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:19,272 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:19,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-04-08 08:19:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2022-04-08 08:19:19,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:19,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have 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:19,330 INFO L74 IsIncluded]: Start isIncluded. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have 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:19,331 INFO L87 Difference]: Start difference. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have 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:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:19,380 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-08 08:19:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-08 08:19:19,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:19,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:19,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 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 1387 states. [2022-04-08 08:19:19,384 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 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 1387 states. [2022-04-08 08:19:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:19,435 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-08 08:19:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-08 08:19:19,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:19,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:19,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:19,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have 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:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2022-04-08 08:19:19,488 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2022-04-08 08:19:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:19,488 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2022-04-08 08:19:19,488 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:19:19,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1775 transitions. [2022-04-08 08:19:20,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1775 edges. 1775 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2022-04-08 08:19:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:19:20,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:20,910 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:19:20,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:19:20,911 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:20,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 1 times [2022-04-08 08:19:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:20,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720081246] [2022-04-08 08:19:20,911 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 2 times [2022-04-08 08:19:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674580942] [2022-04-08 08:19:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:20,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {34633#(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(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-08 08:19:20,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-08 08:19:20,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-08 08:19:20,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {34627#true} call ULTIMATE.init(); {34633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:20,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {34633#(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(18, 2);call #Ultimate.allocInit(12, 3); {34627#true} is VALID [2022-04-08 08:19:20,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {34627#true} assume true; {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34627#true} {34627#true} #285#return; {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {34627#true} call #t~ret20 := main(); {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {34627#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {34627#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {34627#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {34627#true} assume !(0 != ~p1~0); {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {34627#true} assume !(0 != ~p2~0); {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {34627#true} assume !(0 != ~p3~0); {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#true} assume !(0 != ~p4~0); {34627#true} is VALID [2022-04-08 08:19:20,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {34627#true} assume !(0 != ~p5~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p10~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p1~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p2~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p3~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {34632#(= main_~p5~0 0)} assume !(0 != ~p4~0); {34632#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:20,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {34632#(= main_~p5~0 0)} assume 0 != ~p5~0; {34628#false} is VALID [2022-04-08 08:19:20,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {34628#false} assume 1 != ~lk5~0; {34628#false} is VALID [2022-04-08 08:19:20,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {34628#false} assume !false; {34628#false} is VALID [2022-04-08 08:19:20,962 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:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:20,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674580942] [2022-04-08 08:19:20,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674580942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:20,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:20,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:20,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:20,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720081246] [2022-04-08 08:19:20,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720081246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:20,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:20,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:20,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277294178] [2022-04-08 08:19:20,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:20,963 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:19:20,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:20,963 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:19:20,978 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:19:20,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:20,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:20,979 INFO L87 Difference]: Start difference. First operand 1033 states and 1775 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:19:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:21,497 INFO L93 Difference]: Finished difference Result 2461 states and 4257 transitions. [2022-04-08 08:19:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:21,497 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:19:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:21,498 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:19:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-08 08:19:21,499 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:19:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-08 08:19:21,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 270 transitions. [2022-04-08 08:19:21,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:21,742 INFO L225 Difference]: With dead ends: 2461 [2022-04-08 08:19:21,742 INFO L226 Difference]: Without dead ends: 1451 [2022-04-08 08:19:21,743 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:21,743 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 199 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:21,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-08 08:19:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-08 08:19:21,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:21,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have 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:21,839 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have 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:21,840 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have 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:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:21,892 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-08 08:19:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-08 08:19:21,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:21,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:21,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 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 1451 states. [2022-04-08 08:19:21,896 INFO L87 Difference]: Start difference. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 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 1451 states. [2022-04-08 08:19:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:21,947 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-08 08:19:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-08 08:19:21,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:21,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:21,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:21,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have 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:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2022-04-08 08:19:22,031 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2022-04-08 08:19:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:22,031 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2022-04-08 08:19:22,031 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:19:22,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2487 transitions. [2022-04-08 08:19:23,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2022-04-08 08:19:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:19:23,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:23,862 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, 1] [2022-04-08 08:19:23,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:19:23,863 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 1 times [2022-04-08 08:19:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:23,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1209799427] [2022-04-08 08:19:23,864 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 2 times [2022-04-08 08:19:23,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:23,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747404998] [2022-04-08 08:19:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:23,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {45367#(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(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-08 08:19:23,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-08 08:19:23,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {45361#true} call ULTIMATE.init(); {45367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:23,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {45367#(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(18, 2);call #Ultimate.allocInit(12, 3); {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {45361#true} assume true; {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45361#true} {45361#true} #285#return; {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {45361#true} call #t~ret20 := main(); {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {45361#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {45361#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {45361#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {45361#true} assume !(0 != ~p1~0); {45361#true} is VALID [2022-04-08 08:19:23,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {45361#true} assume !(0 != ~p2~0); {45361#true} is VALID [2022-04-08 08:19:23,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {45361#true} assume !(0 != ~p3~0); {45361#true} is VALID [2022-04-08 08:19:23,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {45361#true} assume !(0 != ~p4~0); {45361#true} is VALID [2022-04-08 08:19:23,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {45361#true} assume 0 != ~p5~0;~lk5~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {45366#(not (= main_~p5~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {45366#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:23,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {45366#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {45362#false} is VALID [2022-04-08 08:19:23,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {45362#false} assume 0 != ~p6~0; {45362#false} is VALID [2022-04-08 08:19:23,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {45362#false} assume 1 != ~lk6~0; {45362#false} is VALID [2022-04-08 08:19:23,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {45362#false} assume !false; {45362#false} is VALID [2022-04-08 08:19:23,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:19:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747404998] [2022-04-08 08:19:23,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747404998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:23,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:23,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:23,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:23,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1209799427] [2022-04-08 08:19:23,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1209799427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:23,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:23,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698418837] [2022-04-08 08:19:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 08:19:23,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:23,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:23,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:23,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:23,940 INFO L87 Difference]: Start difference. First operand 1449 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,411 INFO L93 Difference]: Finished difference Result 2173 states and 3721 transitions. [2022-04-08 08:19:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 08:19:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-08 08:19:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-08 08:19:24,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 265 transitions. [2022-04-08 08:19:24,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,651 INFO L225 Difference]: With dead ends: 2173 [2022-04-08 08:19:24,651 INFO L226 Difference]: Without dead ends: 1467 [2022-04-08 08:19:24,654 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:24,654 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 192 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:24,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 151 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-08 08:19:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2022-04-08 08:19:24,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:24,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have 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:24,789 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have 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:24,790 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have 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:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,841 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-08 08:19:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-08 08:19:24,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:24,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:24,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 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 1467 states. [2022-04-08 08:19:24,846 INFO L87 Difference]: Start difference. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 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 1467 states. [2022-04-08 08:19:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,896 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-08 08:19:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-08 08:19:24,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:24,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:24,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:24,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have 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:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2022-04-08 08:19:24,976 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2022-04-08 08:19:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:24,976 INFO L478 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2022-04-08 08:19:24,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:24,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1465 states and 2487 transitions. [2022-04-08 08:19:27,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2487 edges. 2487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2022-04-08 08:19:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:19:27,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:27,134 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, 1] [2022-04-08 08:19:27,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:19:27,134 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 1 times [2022-04-08 08:19:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:27,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2011198891] [2022-04-08 08:19:27,135 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 2 times [2022-04-08 08:19:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:27,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491789648] [2022-04-08 08:19:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:27,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:27,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {55589#(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(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-08 08:19:27,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-08 08:19:27,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-08 08:19:27,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {55583#true} call ULTIMATE.init(); {55589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:27,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {55589#(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(18, 2);call #Ultimate.allocInit(12, 3); {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {55583#true} assume true; {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55583#true} {55583#true} #285#return; {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {55583#true} call #t~ret20 := main(); {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {55583#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {55583#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {55583#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {55583#true} assume !(0 != ~p1~0); {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {55583#true} assume !(0 != ~p2~0); {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {55583#true} assume !(0 != ~p3~0); {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {55583#true} assume !(0 != ~p4~0); {55583#true} is VALID [2022-04-08 08:19:27,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {55583#true} assume !(0 != ~p5~0); {55583#true} is VALID [2022-04-08 08:19:27,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {55583#true} assume 0 != ~p6~0;~lk6~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {55588#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {55588#(= main_~lk6~0 1)} assume 0 != ~p6~0; {55588#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:27,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {55588#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {55584#false} is VALID [2022-04-08 08:19:27,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {55584#false} assume !false; {55584#false} is VALID [2022-04-08 08:19:27,199 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:27,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:27,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491789648] [2022-04-08 08:19:27,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491789648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:27,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:27,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:27,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:27,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2011198891] [2022-04-08 08:19:27,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2011198891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:27,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:27,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:27,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260710401] [2022-04-08 08:19:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:27,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 08:19:27,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:27,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:27,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:27,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:27,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:27,218 INFO L87 Difference]: Start difference. First operand 1465 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:27,834 INFO L93 Difference]: Finished difference Result 2701 states and 4665 transitions. [2022-04-08 08:19:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 08:19:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 08:19:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 08:19:27,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-08 08:19:27,928 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:19:28,240 INFO L225 Difference]: With dead ends: 2701 [2022-04-08 08:19:28,241 INFO L226 Difference]: Without dead ends: 2699 [2022-04-08 08:19:28,241 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:28,242 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:28,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 103 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-08 08:19:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2022-04-08 08:19:28,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:28,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have 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:28,373 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have 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:28,375 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have 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:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:28,545 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-08 08:19:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-08 08:19:28,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:28,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:28,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 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 2699 states. [2022-04-08 08:19:28,556 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 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 2699 states. [2022-04-08 08:19:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:28,730 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-08 08:19:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-08 08:19:28,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:28,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:28,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:28,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have 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:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2022-04-08 08:19:28,921 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2022-04-08 08:19:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:28,922 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2022-04-08 08:19:28,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:28,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 3415 transitions. [2022-04-08 08:19:31,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3415 edges. 3415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2022-04-08 08:19:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:19:31,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:31,662 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, 1] [2022-04-08 08:19:31,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:19:31,662 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:31,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 1 times [2022-04-08 08:19:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:31,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517424576] [2022-04-08 08:19:31,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 2 times [2022-04-08 08:19:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:31,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383427553] [2022-04-08 08:19:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:31,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:31,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {70515#(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(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-08 08:19:31,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-08 08:19:31,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {70509#true} call ULTIMATE.init(); {70515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {70515#(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(18, 2);call #Ultimate.allocInit(12, 3); {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {70509#true} assume true; {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70509#true} {70509#true} #285#return; {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {70509#true} call #t~ret20 := main(); {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {70509#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {70509#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {70509#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {70509#true} assume !(0 != ~p1~0); {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {70509#true} assume !(0 != ~p2~0); {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {70509#true} assume !(0 != ~p3~0); {70509#true} is VALID [2022-04-08 08:19:31,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {70509#true} assume !(0 != ~p4~0); {70509#true} is VALID [2022-04-08 08:19:31,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {70509#true} assume !(0 != ~p5~0); {70509#true} is VALID [2022-04-08 08:19:31,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {70509#true} assume !(0 != ~p6~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p10~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p1~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p2~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p3~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p4~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {70514#(= main_~p6~0 0)} assume !(0 != ~p5~0); {70514#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:31,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {70514#(= main_~p6~0 0)} assume 0 != ~p6~0; {70510#false} is VALID [2022-04-08 08:19:31,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {70510#false} assume 1 != ~lk6~0; {70510#false} is VALID [2022-04-08 08:19:31,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {70510#false} assume !false; {70510#false} is VALID [2022-04-08 08:19:31,761 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:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:31,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383427553] [2022-04-08 08:19:31,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383427553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:31,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:31,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:31,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:31,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517424576] [2022-04-08 08:19:31,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517424576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:31,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:31,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833804782] [2022-04-08 08:19:31,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:31,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 08:19:31,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:31,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:31,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:31,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:31,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:31,794 INFO L87 Difference]: Start difference. First operand 2057 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:33,153 INFO L93 Difference]: Finished difference Result 4877 states and 8153 transitions. [2022-04-08 08:19:33,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:33,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 08:19:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-08 08:19:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-08 08:19:33,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2022-04-08 08:19:33,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:33,593 INFO L225 Difference]: With dead ends: 4877 [2022-04-08 08:19:33,593 INFO L226 Difference]: Without dead ends: 2859 [2022-04-08 08:19:33,596 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:33,598 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:33,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 145 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-04-08 08:19:33,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2022-04-08 08:19:33,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:33,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have 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:33,793 INFO L74 IsIncluded]: Start isIncluded. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have 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:33,795 INFO L87 Difference]: Start difference. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have 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:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:33,985 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-08 08:19:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-08 08:19:33,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:33,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:33,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 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 2859 states. [2022-04-08 08:19:33,993 INFO L87 Difference]: Start difference. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 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 2859 states. [2022-04-08 08:19:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:34,198 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-08 08:19:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-08 08:19:34,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:34,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:34,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:34,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:34,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have 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,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2022-04-08 08:19:34,524 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2022-04-08 08:19:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:34,524 INFO L478 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2022-04-08 08:19:34,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have 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,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2857 states and 4743 transitions. [2022-04-08 08:19:39,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2022-04-08 08:19:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:19:39,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:39,113 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, 1, 1] [2022-04-08 08:19:39,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:19:39,114 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 1 times [2022-04-08 08:19:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:39,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [605048091] [2022-04-08 08:19:39,114 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 2 times [2022-04-08 08:19:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:39,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175930545] [2022-04-08 08:19:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:39,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {91713#(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(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-08 08:19:39,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-08 08:19:39,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-08 08:19:39,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {91707#true} call ULTIMATE.init(); {91713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:39,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {91713#(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(18, 2);call #Ultimate.allocInit(12, 3); {91707#true} is VALID [2022-04-08 08:19:39,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {91707#true} assume true; {91707#true} is VALID [2022-04-08 08:19:39,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91707#true} {91707#true} #285#return; {91707#true} is VALID [2022-04-08 08:19:39,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {91707#true} call #t~ret20 := main(); {91707#true} is VALID [2022-04-08 08:19:39,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {91707#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {91707#true} is VALID [2022-04-08 08:19:39,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {91707#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {91707#true} is VALID [2022-04-08 08:19:39,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {91707#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {91707#true} is VALID [2022-04-08 08:19:39,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {91707#true} assume !(0 != ~p1~0); {91707#true} is VALID [2022-04-08 08:19:39,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {91707#true} assume !(0 != ~p2~0); {91707#true} is VALID [2022-04-08 08:19:39,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {91707#true} assume !(0 != ~p3~0); {91707#true} is VALID [2022-04-08 08:19:39,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {91707#true} assume !(0 != ~p4~0); {91707#true} is VALID [2022-04-08 08:19:39,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {91707#true} assume !(0 != ~p5~0); {91707#true} is VALID [2022-04-08 08:19:39,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {91707#true} assume 0 != ~p6~0;~lk6~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {91712#(not (= main_~p6~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {91712#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:39,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {91712#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {91708#false} is VALID [2022-04-08 08:19:39,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {91708#false} assume 0 != ~p7~0; {91708#false} is VALID [2022-04-08 08:19:39,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {91708#false} assume 1 != ~lk7~0; {91708#false} is VALID [2022-04-08 08:19:39,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {91708#false} assume !false; {91708#false} is VALID [2022-04-08 08:19:39,170 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:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175930545] [2022-04-08 08:19:39,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175930545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:39,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:39,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:39,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [605048091] [2022-04-08 08:19:39,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [605048091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:39,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:39,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782066175] [2022-04-08 08:19:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 08:19:39,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:39,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:39,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:39,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:39,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:39,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:39,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:39,185 INFO L87 Difference]: Start difference. First operand 2857 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:40,350 INFO L93 Difference]: Finished difference Result 4285 states and 7097 transitions. [2022-04-08 08:19:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:40,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 08:19:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-08 08:19:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-08 08:19:40,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-08 08:19:40,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:40,792 INFO L225 Difference]: With dead ends: 4285 [2022-04-08 08:19:40,792 INFO L226 Difference]: Without dead ends: 2891 [2022-04-08 08:19:40,795 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,795 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:40,795 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-04-08 08:19:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2022-04-08 08:19:41,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:41,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have 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,011 INFO L74 IsIncluded]: Start isIncluded. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have 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,013 INFO L87 Difference]: Start difference. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have 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,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:41,209 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-08 08:19:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-08 08:19:41,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:41,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:41,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 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 2891 states. [2022-04-08 08:19:41,217 INFO L87 Difference]: Start difference. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 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 2891 states. [2022-04-08 08:19:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:41,415 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-08 08:19:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-08 08:19:41,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:41,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:41,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:41,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have 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,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2022-04-08 08:19:41,756 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2022-04-08 08:19:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:41,756 INFO L478 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2022-04-08 08:19:41,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2889 states and 4743 transitions. [2022-04-08 08:19:46,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4743 edges. 4743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2022-04-08 08:19:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:19:46,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:46,199 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, 1, 1] [2022-04-08 08:19:46,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:19:46,199 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 1 times [2022-04-08 08:19:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:46,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951194064] [2022-04-08 08:19:46,200 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 2 times [2022-04-08 08:19:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:46,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855559784] [2022-04-08 08:19:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:46,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {111855#(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(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-08 08:19:46,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-08 08:19:46,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-08 08:19:46,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {111849#true} call ULTIMATE.init(); {111855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:46,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {111855#(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(18, 2);call #Ultimate.allocInit(12, 3); {111849#true} is VALID [2022-04-08 08:19:46,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {111849#true} assume true; {111849#true} is VALID [2022-04-08 08:19:46,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111849#true} {111849#true} #285#return; {111849#true} is VALID [2022-04-08 08:19:46,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {111849#true} call #t~ret20 := main(); {111849#true} is VALID [2022-04-08 08:19:46,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {111849#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {111849#true} is VALID [2022-04-08 08:19:46,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {111849#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {111849#true} is VALID [2022-04-08 08:19:46,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {111849#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {111849#true} is VALID [2022-04-08 08:19:46,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {111849#true} assume !(0 != ~p1~0); {111849#true} is VALID [2022-04-08 08:19:46,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {111849#true} assume !(0 != ~p2~0); {111849#true} is VALID [2022-04-08 08:19:46,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {111849#true} assume !(0 != ~p3~0); {111849#true} is VALID [2022-04-08 08:19:46,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {111849#true} assume !(0 != ~p4~0); {111849#true} is VALID [2022-04-08 08:19:46,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {111849#true} assume !(0 != ~p5~0); {111849#true} is VALID [2022-04-08 08:19:46,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {111849#true} assume !(0 != ~p6~0); {111849#true} is VALID [2022-04-08 08:19:46,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {111849#true} assume 0 != ~p7~0;~lk7~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {111854#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {111854#(= main_~lk7~0 1)} assume 0 != ~p7~0; {111854#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:46,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {111854#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {111850#false} is VALID [2022-04-08 08:19:46,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {111850#false} assume !false; {111850#false} is VALID [2022-04-08 08:19:46,278 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:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855559784] [2022-04-08 08:19:46,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855559784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:46,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:46,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:46,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:46,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951194064] [2022-04-08 08:19:46,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951194064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:46,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:46,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:46,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493824534] [2022-04-08 08:19:46,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 08:19:46,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:46,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:46,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:46,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:46,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:46,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:46,292 INFO L87 Difference]: Start difference. First operand 2889 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:47,858 INFO L93 Difference]: Finished difference Result 5261 states and 8809 transitions. [2022-04-08 08:19:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:47,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 08:19:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-08 08:19:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-08 08:19:47,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-08 08:19:47,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:49,084 INFO L225 Difference]: With dead ends: 5261 [2022-04-08 08:19:49,084 INFO L226 Difference]: Without dead ends: 5259 [2022-04-08 08:19:49,085 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:49,085 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:49,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-08 08:19:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2022-04-08 08:19:49,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:49,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have 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:49,383 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have 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:49,386 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have 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:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:50,061 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-08 08:19:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-08 08:19:50,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:50,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:50,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 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 5259 states. [2022-04-08 08:19:50,073 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 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 5259 states. [2022-04-08 08:19:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:50,757 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-08 08:19:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-08 08:19:50,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:50,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:50,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:50,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have 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:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2022-04-08 08:19:51,487 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2022-04-08 08:19:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:51,487 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2022-04-08 08:19:51,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:51,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 6567 transitions. [2022-04-08 08:19:57,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6567 edges. 6567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2022-04-08 08:19:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:19:57,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:57,611 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, 1, 1] [2022-04-08 08:19:57,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:19:57,611 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:57,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 1 times [2022-04-08 08:19:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1235791182] [2022-04-08 08:19:57,612 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 2 times [2022-04-08 08:19:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817844165] [2022-04-08 08:19:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:57,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {141117#(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(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-08 08:19:57,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-08 08:19:57,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-08 08:19:57,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {141111#true} call ULTIMATE.init(); {141117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:57,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {141117#(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(18, 2);call #Ultimate.allocInit(12, 3); {141111#true} is VALID [2022-04-08 08:19:57,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {141111#true} assume true; {141111#true} is VALID [2022-04-08 08:19:57,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141111#true} {141111#true} #285#return; {141111#true} is VALID [2022-04-08 08:19:57,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {141111#true} call #t~ret20 := main(); {141111#true} is VALID [2022-04-08 08:19:57,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {141111#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {141111#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {141111#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {141111#true} assume !(0 != ~p1~0); {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {141111#true} assume !(0 != ~p2~0); {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {141111#true} assume !(0 != ~p3~0); {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {141111#true} assume !(0 != ~p4~0); {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {141111#true} assume !(0 != ~p5~0); {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {141111#true} assume !(0 != ~p6~0); {141111#true} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {141111#true} assume !(0 != ~p7~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p10~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p1~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p2~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p3~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p4~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p5~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {141116#(= main_~p7~0 0)} assume !(0 != ~p6~0); {141116#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:57,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {141116#(= main_~p7~0 0)} assume 0 != ~p7~0; {141112#false} is VALID [2022-04-08 08:19:57,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {141112#false} assume 1 != ~lk7~0; {141112#false} is VALID [2022-04-08 08:19:57,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {141112#false} assume !false; {141112#false} is VALID [2022-04-08 08:19:57,646 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:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:57,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817844165] [2022-04-08 08:19:57,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817844165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:57,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:57,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:57,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:57,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1235791182] [2022-04-08 08:19:57,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1235791182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:57,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:57,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326678747] [2022-04-08 08:19:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:57,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 08:19:57,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:57,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:57,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:57,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:57,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:57,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:57,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:57,663 INFO L87 Difference]: Start difference. First operand 4105 states and 6567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:02,158 INFO L93 Difference]: Finished difference Result 9677 states and 15593 transitions. [2022-04-08 08:20:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:02,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 08:20:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-08 08:20:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-08 08:20:02,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-08 08:20:02,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:03,552 INFO L225 Difference]: With dead ends: 9677 [2022-04-08 08:20:03,553 INFO L226 Difference]: Without dead ends: 5643 [2022-04-08 08:20:03,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:20:03,558 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:03,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 147 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-08 08:20:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2022-04-08 08:20:03,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:03,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have 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:03,980 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have 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:03,984 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have 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:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:04,766 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-08 08:20:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-08 08:20:04,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:04,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:04,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 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 5643 states. [2022-04-08 08:20:04,785 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 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 5643 states. [2022-04-08 08:20:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:05,578 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-08 08:20:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-08 08:20:05,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:05,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:05,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:05,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have 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:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2022-04-08 08:20:06,810 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2022-04-08 08:20:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:06,810 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2022-04-08 08:20:06,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have 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:06,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5641 states and 9031 transitions. [2022-04-08 08:20:14,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2022-04-08 08:20:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 08:20:14,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:14,387 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, 1, 1, 1] [2022-04-08 08:20:14,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:20:14,387 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 1 times [2022-04-08 08:20:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:14,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872083295] [2022-04-08 08:20:14,389 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 2 times [2022-04-08 08:20:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:14,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346672299] [2022-04-08 08:20:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:14,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:14,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:14,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {183051#(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(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-08 08:20:14,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-08 08:20:14,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-08 08:20:14,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {183045#true} call ULTIMATE.init(); {183051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:14,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {183051#(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(18, 2);call #Ultimate.allocInit(12, 3); {183045#true} is VALID [2022-04-08 08:20:14,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {183045#true} assume true; {183045#true} is VALID [2022-04-08 08:20:14,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183045#true} {183045#true} #285#return; {183045#true} is VALID [2022-04-08 08:20:14,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {183045#true} call #t~ret20 := main(); {183045#true} is VALID [2022-04-08 08:20:14,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {183045#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {183045#true} is VALID [2022-04-08 08:20:14,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {183045#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {183045#true} is VALID [2022-04-08 08:20:14,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {183045#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {183045#true} is VALID [2022-04-08 08:20:14,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {183045#true} assume !(0 != ~p1~0); {183045#true} is VALID [2022-04-08 08:20:14,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {183045#true} assume !(0 != ~p2~0); {183045#true} is VALID [2022-04-08 08:20:14,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {183045#true} assume !(0 != ~p3~0); {183045#true} is VALID [2022-04-08 08:20:14,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {183045#true} assume !(0 != ~p4~0); {183045#true} is VALID [2022-04-08 08:20:14,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {183045#true} assume !(0 != ~p5~0); {183045#true} is VALID [2022-04-08 08:20:14,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {183045#true} assume !(0 != ~p6~0); {183045#true} is VALID [2022-04-08 08:20:14,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {183045#true} assume 0 != ~p7~0;~lk7~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {183050#(not (= main_~p7~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {183050#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:14,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {183050#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {183046#false} is VALID [2022-04-08 08:20:14,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {183046#false} assume 0 != ~p8~0; {183046#false} is VALID [2022-04-08 08:20:14,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {183046#false} assume 1 != ~lk8~0; {183046#false} is VALID [2022-04-08 08:20:14,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {183046#false} assume !false; {183046#false} is VALID [2022-04-08 08:20:14,455 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:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346672299] [2022-04-08 08:20:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346672299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:14,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:14,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:14,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:14,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872083295] [2022-04-08 08:20:14,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872083295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:14,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:14,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111045893] [2022-04-08 08:20:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 08:20:14,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:14,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:14,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:14,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:14,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:14,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:14,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:14,474 INFO L87 Difference]: Start difference. First operand 5641 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:18,050 INFO L93 Difference]: Finished difference Result 8461 states and 13513 transitions. [2022-04-08 08:20:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:18,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 08:20:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-08 08:20:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-08 08:20:18,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-08 08:20:18,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:19,446 INFO L225 Difference]: With dead ends: 8461 [2022-04-08 08:20:19,447 INFO L226 Difference]: Without dead ends: 5707 [2022-04-08 08:20:19,450 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:19,451 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:19,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-04-08 08:20:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2022-04-08 08:20:19,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:19,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have 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:19,914 INFO L74 IsIncluded]: Start isIncluded. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have 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:19,921 INFO L87 Difference]: Start difference. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have 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:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:20,703 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-08 08:20:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-08 08:20:20,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:20,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:20,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 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 5707 states. [2022-04-08 08:20:20,733 INFO L87 Difference]: Start difference. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 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 5707 states. [2022-04-08 08:20:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:21,553 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-08 08:20:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-08 08:20:21,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:21,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:21,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:21,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have 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:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2022-04-08 08:20:22,933 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2022-04-08 08:20:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:22,933 INFO L478 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2022-04-08 08:20:22,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:22,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5705 states and 9031 transitions. [2022-04-08 08:20:30,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9031 edges. 9031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2022-04-08 08:20:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 08:20:30,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:30,649 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, 1, 1, 1] [2022-04-08 08:20:30,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:20:30,650 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 1 times [2022-04-08 08:20:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:30,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537935386] [2022-04-08 08:20:30,650 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 2 times [2022-04-08 08:20:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:30,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668372712] [2022-04-08 08:20:30,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:30,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:30,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {222809#(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(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-08 08:20:30,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-08 08:20:30,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-08 08:20:30,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {222803#true} call ULTIMATE.init(); {222809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:30,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {222809#(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(18, 2);call #Ultimate.allocInit(12, 3); {222803#true} is VALID [2022-04-08 08:20:30,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {222803#true} assume true; {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222803#true} {222803#true} #285#return; {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {222803#true} call #t~ret20 := main(); {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {222803#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {222803#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {222803#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {222803#true} assume !(0 != ~p1~0); {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {222803#true} assume !(0 != ~p2~0); {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {222803#true} assume !(0 != ~p3~0); {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {222803#true} assume !(0 != ~p4~0); {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {222803#true} assume !(0 != ~p5~0); {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {222803#true} assume !(0 != ~p6~0); {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {222803#true} assume !(0 != ~p7~0); {222803#true} is VALID [2022-04-08 08:20:30,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {222803#true} assume 0 != ~p8~0;~lk8~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {222808#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {222808#(= main_~lk8~0 1)} assume 0 != ~p8~0; {222808#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:30,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {222808#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {222804#false} is VALID [2022-04-08 08:20:30,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {222804#false} assume !false; {222804#false} is VALID [2022-04-08 08:20:30,707 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:30,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:30,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668372712] [2022-04-08 08:20:30,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668372712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:30,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:30,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:30,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:30,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537935386] [2022-04-08 08:20:30,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537935386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:30,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:30,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:30,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020990512] [2022-04-08 08:20:30,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:30,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 08:20:30,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:30,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:30,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:30,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:30,727 INFO L87 Difference]: Start difference. First operand 5705 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:35,963 INFO L93 Difference]: Finished difference Result 10253 states and 16585 transitions. [2022-04-08 08:20:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 08:20:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 08:20:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 08:20:35,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 08:20:36,083 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:20:40,140 INFO L225 Difference]: With dead ends: 10253 [2022-04-08 08:20:40,140 INFO L226 Difference]: Without dead ends: 10251 [2022-04-08 08:20:40,141 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:40,142 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:40,142 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 101 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2022-04-08 08:20:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2022-04-08 08:20:40,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:40,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have 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:40,791 INFO L74 IsIncluded]: Start isIncluded. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have 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:40,797 INFO L87 Difference]: Start difference. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have 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,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:43,498 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-08 08:20:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-08 08:20:43,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:43,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:43,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 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 10251 states. [2022-04-08 08:20:43,526 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 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 10251 states. [2022-04-08 08:20:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:46,246 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-08 08:20:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-08 08:20:46,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:46,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:46,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:46,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have 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:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2022-04-08 08:20:49,201 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2022-04-08 08:20:49,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:49,202 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2022-04-08 08:20:49,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:49,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 12615 transitions. [2022-04-08 08:20:59,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12615 edges. 12615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2022-04-08 08:20:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 08:20:59,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:59,621 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, 1, 1, 1] [2022-04-08 08:20:59,621 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:20:59,621 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:59,621 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 1 times [2022-04-08 08:20:59,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:59,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558236290] [2022-04-08 08:20:59,622 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:59,622 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 2 times [2022-04-08 08:20:59,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:59,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149257733] [2022-04-08 08:20:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:59,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:59,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {280231#(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(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-08 08:20:59,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-08 08:20:59,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-08 08:20:59,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {280225#true} call ULTIMATE.init(); {280231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:59,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {280231#(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(18, 2);call #Ultimate.allocInit(12, 3); {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {280225#true} assume true; {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {280225#true} {280225#true} #285#return; {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {280225#true} call #t~ret20 := main(); {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {280225#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {280225#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {280225#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {280225#true} assume !(0 != ~p1~0); {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {280225#true} assume !(0 != ~p2~0); {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {280225#true} assume !(0 != ~p3~0); {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {280225#true} assume !(0 != ~p4~0); {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {280225#true} assume !(0 != ~p5~0); {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {280225#true} assume !(0 != ~p6~0); {280225#true} is VALID [2022-04-08 08:20:59,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {280225#true} assume !(0 != ~p7~0); {280225#true} is VALID [2022-04-08 08:20:59,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {280225#true} assume !(0 != ~p8~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p10~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p1~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p2~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p3~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p4~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p5~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p6~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {280230#(= main_~p8~0 0)} assume !(0 != ~p7~0); {280230#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:59,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {280230#(= main_~p8~0 0)} assume 0 != ~p8~0; {280226#false} is VALID [2022-04-08 08:20:59,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {280226#false} assume 1 != ~lk8~0; {280226#false} is VALID [2022-04-08 08:20:59,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {280226#false} assume !false; {280226#false} is VALID [2022-04-08 08:20:59,693 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:59,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:59,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149257733] [2022-04-08 08:20:59,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149257733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:59,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:59,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:59,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:59,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558236290] [2022-04-08 08:20:59,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558236290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:59,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:59,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:59,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456933072] [2022-04-08 08:20:59,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:59,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 08:20:59,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:59,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:59,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:59,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:59,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:59,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:59,710 INFO L87 Difference]: Start difference. First operand 8201 states and 12615 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:16,439 INFO L93 Difference]: Finished difference Result 19213 states and 29769 transitions. [2022-04-08 08:21:16,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:21:16,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 08:21:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:21:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-08 08:21:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-08 08:21:16,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 261 transitions. [2022-04-08 08:21:16,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:21,238 INFO L225 Difference]: With dead ends: 19213 [2022-04-08 08:21:21,238 INFO L226 Difference]: Without dead ends: 11147 [2022-04-08 08:21:21,246 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:21:21,247 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:21:21,247 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:21:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2022-04-08 08:21:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2022-04-08 08:21:22,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:21:22,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 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:22,159 INFO L74 IsIncluded]: Start isIncluded. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 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:22,173 INFO L87 Difference]: Start difference. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 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:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:25,308 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-08 08:21:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-08 08:21:25,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:25,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:25,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 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 11147 states. [2022-04-08 08:21:25,342 INFO L87 Difference]: Start difference. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 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 11147 states. [2022-04-08 08:21:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:28,509 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-08 08:21:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-08 08:21:28,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:28,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:28,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:21:28,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:21:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 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:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2022-04-08 08:21:33,611 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2022-04-08 08:21:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:21:33,611 INFO L478 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2022-04-08 08:21:33,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have 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:33,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11145 states and 17159 transitions. [2022-04-08 08:21:49,950 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:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2022-04-08 08:21:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 08:21:49,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:21:49,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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:21:49,957 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:21:49,957 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:21:49,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:21:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 1 times [2022-04-08 08:21:49,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:49,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771115797] [2022-04-08 08:21:49,959 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:21:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 2 times [2022-04-08 08:21:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:21:49,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490428372] [2022-04-08 08:21:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:21:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:21:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:21:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:50,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {363253#(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(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-08 08:21:50,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-08 08:21:50,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-08 08:21:50,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {363247#true} call ULTIMATE.init(); {363253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:21:50,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {363253#(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(18, 2);call #Ultimate.allocInit(12, 3); {363247#true} is VALID [2022-04-08 08:21:50,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {363247#true} assume true; {363247#true} is VALID [2022-04-08 08:21:50,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363247#true} {363247#true} #285#return; {363247#true} is VALID [2022-04-08 08:21:50,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {363247#true} call #t~ret20 := main(); {363247#true} is VALID [2022-04-08 08:21:50,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {363247#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {363247#true} is VALID [2022-04-08 08:21:50,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {363247#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {363247#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {363247#true} assume !(0 != ~p1~0); {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {363247#true} assume !(0 != ~p2~0); {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {363247#true} assume !(0 != ~p3~0); {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {363247#true} assume !(0 != ~p4~0); {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {363247#true} assume !(0 != ~p5~0); {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {363247#true} assume !(0 != ~p6~0); {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {363247#true} assume !(0 != ~p7~0); {363247#true} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {363247#true} assume 0 != ~p8~0;~lk8~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {363252#(not (= main_~p8~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {363252#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:50,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {363252#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {363248#false} is VALID [2022-04-08 08:21:50,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {363248#false} assume 0 != ~p9~0; {363248#false} is VALID [2022-04-08 08:21:50,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {363248#false} assume 1 != ~lk9~0; {363248#false} is VALID [2022-04-08 08:21:50,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {363248#false} assume !false; {363248#false} is VALID [2022-04-08 08:21:50,015 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:50,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:21:50,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490428372] [2022-04-08 08:21:50,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490428372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:50,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:50,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:50,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:21:50,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771115797] [2022-04-08 08:21:50,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771115797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:50,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:50,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917832824] [2022-04-08 08:21:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:21:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 08:21:50,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:21:50,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:50,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:50,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:21:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:21:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:21:50,036 INFO L87 Difference]: Start difference. First operand 11145 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:03,147 INFO L93 Difference]: Finished difference Result 16717 states and 25673 transitions. [2022-04-08 08:22:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:22:03,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 08:22:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:22:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-08 08:22:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-08 08:22:03,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 256 transitions. [2022-04-08 08:22:03,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:08,162 INFO L225 Difference]: With dead ends: 16717 [2022-04-08 08:22:08,162 INFO L226 Difference]: Without dead ends: 11275 [2022-04-08 08:22:08,170 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:08,170 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:22:08,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:22:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2022-04-08 08:22:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2022-04-08 08:22:09,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:22:09,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 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:09,122 INFO L74 IsIncluded]: Start isIncluded. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 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:09,137 INFO L87 Difference]: Start difference. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 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,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:12,507 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-08 08:22:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-08 08:22:12,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:12,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:22:12,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 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 11275 states. [2022-04-08 08:22:12,541 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 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 11275 states. [2022-04-08 08:22:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:16,009 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-08 08:22:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-08 08:22:16,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:16,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:22:16,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:22:16,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:22:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 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:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2022-04-08 08:22:21,312 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2022-04-08 08:22:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:22:21,312 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2022-04-08 08:22:21,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:21,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11273 states and 17159 transitions. [2022-04-08 08:22:38,242 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:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2022-04-08 08:22:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 08:22:38,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:22:38,248 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, 1, 1, 1, 1] [2022-04-08 08:22:38,248 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:22:38,248 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:22:38,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:22:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 1 times [2022-04-08 08:22:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:38,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [282441148] [2022-04-08 08:22:38,250 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:22:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 2 times [2022-04-08 08:22:38,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:22:38,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723654116] [2022-04-08 08:22:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:22:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:22:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:22:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:38,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {441795#(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(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-08 08:22:38,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-08 08:22:38,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {441789#true} call ULTIMATE.init(); {441795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {441795#(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(18, 2);call #Ultimate.allocInit(12, 3); {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {441789#true} assume true; {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441789#true} {441789#true} #285#return; {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {441789#true} call #t~ret20 := main(); {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {441789#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {441789#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {441789#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {441789#true} assume !(0 != ~p1~0); {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {441789#true} assume !(0 != ~p2~0); {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {441789#true} assume !(0 != ~p3~0); {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {441789#true} assume !(0 != ~p4~0); {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {441789#true} assume !(0 != ~p5~0); {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {441789#true} assume !(0 != ~p6~0); {441789#true} is VALID [2022-04-08 08:22:38,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {441789#true} assume !(0 != ~p7~0); {441789#true} is VALID [2022-04-08 08:22:38,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {441789#true} assume !(0 != ~p8~0); {441789#true} is VALID [2022-04-08 08:22:38,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {441789#true} assume 0 != ~p9~0;~lk9~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {441794#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {441794#(= main_~lk9~0 1)} assume 0 != ~p9~0; {441794#(= main_~lk9~0 1)} is VALID [2022-04-08 08:22:38,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {441794#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {441790#false} is VALID [2022-04-08 08:22:38,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {441790#false} assume !false; {441790#false} is VALID [2022-04-08 08:22:38,316 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:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:22:38,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723654116] [2022-04-08 08:22:38,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723654116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:38,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:38,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:38,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:22:38,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [282441148] [2022-04-08 08:22:38,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [282441148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:38,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:38,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204513640] [2022-04-08 08:22:38,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:22:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 08:22:38,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:22:38,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:38,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:38,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:22:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:38,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:22:38,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:22:38,335 INFO L87 Difference]: Start difference. First operand 11273 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:58,276 INFO L93 Difference]: Finished difference Result 19981 states and 31113 transitions. [2022-04-08 08:22:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:22:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 08:22:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:22:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 08:22:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 08:22:58,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-08 08:22:58,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:23:14,460 INFO L225 Difference]: With dead ends: 19981 [2022-04-08 08:23:14,461 INFO L226 Difference]: Without dead ends: 19979 [2022-04-08 08:23:14,465 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:23:14,465 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:23:14,465 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:23:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2022-04-08 08:23:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2022-04-08 08:23:15,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:23:15,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have 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:23:15,870 INFO L74 IsIncluded]: Start isIncluded. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have 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:23:15,893 INFO L87 Difference]: Start difference. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have 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:23:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:23:26,049 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-08 08:23:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-08 08:23:26,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:23:26,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:23:26,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 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 19979 states. [2022-04-08 08:23:26,108 INFO L87 Difference]: Start difference. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 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 19979 states. [2022-04-08 08:23:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:23:36,266 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-08 08:23:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-08 08:23:36,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:23:36,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:23:36,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:23:36,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:23:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have 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:23:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2022-04-08 08:23:48,207 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2022-04-08 08:23:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:23:48,207 INFO L478 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2022-04-08 08:23:48,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:23:48,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16393 states and 24199 transitions. [2022-04-08 08:24:11,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24199 edges. 24199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:24:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2022-04-08 08:24:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 08:24:11,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:24:11,784 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, 1, 1, 1, 1] [2022-04-08 08:24:11,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:24:11,784 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:24:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:24:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 1 times [2022-04-08 08:24:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:24:11,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053046584] [2022-04-08 08:24:11,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:24:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 2 times [2022-04-08 08:24:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:24:11,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524588721] [2022-04-08 08:24:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:24:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:24:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:24:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:11,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {554513#(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(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-08 08:24:11,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-08 08:24:11,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {554507#true} call ULTIMATE.init(); {554513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {554513#(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(18, 2);call #Ultimate.allocInit(12, 3); {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {554507#true} assume true; {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554507#true} {554507#true} #285#return; {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {554507#true} call #t~ret20 := main(); {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {554507#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {554507#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {554507#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {554507#true} assume !(0 != ~p1~0); {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {554507#true} assume !(0 != ~p2~0); {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {554507#true} assume !(0 != ~p3~0); {554507#true} is VALID [2022-04-08 08:24:11,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {554507#true} assume !(0 != ~p4~0); {554507#true} is VALID [2022-04-08 08:24:11,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {554507#true} assume !(0 != ~p5~0); {554507#true} is VALID [2022-04-08 08:24:11,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {554507#true} assume !(0 != ~p6~0); {554507#true} is VALID [2022-04-08 08:24:11,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {554507#true} assume !(0 != ~p7~0); {554507#true} is VALID [2022-04-08 08:24:11,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {554507#true} assume !(0 != ~p8~0); {554507#true} is VALID [2022-04-08 08:24:11,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {554507#true} assume !(0 != ~p9~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p10~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p1~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p2~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p3~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p4~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p5~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p6~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p7~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {554512#(= main_~p9~0 0)} assume !(0 != ~p8~0); {554512#(= main_~p9~0 0)} is VALID [2022-04-08 08:24:11,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {554512#(= main_~p9~0 0)} assume 0 != ~p9~0; {554508#false} is VALID [2022-04-08 08:24:11,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {554508#false} assume 1 != ~lk9~0; {554508#false} is VALID [2022-04-08 08:24:11,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {554508#false} assume !false; {554508#false} is VALID [2022-04-08 08:24:11,830 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:24:11,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:24:11,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524588721] [2022-04-08 08:24:11,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524588721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:24:11,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:24:11,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:24:11,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:24:11,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053046584] [2022-04-08 08:24:11,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053046584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:24:11,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:24:11,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:24:11,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112395269] [2022-04-08 08:24:11,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:24:11,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 08:24:11,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:24:11,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:24:11,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:24:11,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:24:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:24:11,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:24:11,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:24:11,849 INFO L87 Difference]: Start difference. First operand 16393 states and 24199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:31,786 INFO L93 Difference]: Finished difference Result 38157 states and 56713 transitions. [2022-04-08 08:26:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:26:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 08:26:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:26:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-08 08:26:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-08 08:26:31,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-08 08:26:31,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:51,140 INFO L225 Difference]: With dead ends: 38157 [2022-04-08 08:26:51,140 INFO L226 Difference]: Without dead ends: 22027 [2022-04-08 08:26:51,159 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:26:51,160 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:26:51,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 151 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:26:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2022-04-08 08:26:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2022-04-08 08:26:53,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:26:53,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have 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:53,189 INFO L74 IsIncluded]: Start isIncluded. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have 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:53,217 INFO L87 Difference]: Start difference. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have 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:27:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:06,299 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-08 08:27:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-08 08:27:06,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:27:06,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:27:06,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 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 22027 states. [2022-04-08 08:27:06,374 INFO L87 Difference]: Start difference. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 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 22027 states. [2022-04-08 08:27:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:19,575 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-08 08:27:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-08 08:27:19,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:27:19,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:27:19,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:27:19,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:27:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have 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:27:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2022-04-08 08:27:42,040 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2022-04-08 08:27:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:27:42,040 INFO L478 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2022-04-08 08:27:42,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have 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:27:42,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22025 states and 32519 transitions. [2022-04-08 08:28:16,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32519 edges. 32519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:28:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2022-04-08 08:28:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 08:28:16,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:28:16,220 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, 1, 1, 1, 1, 1] [2022-04-08 08:28:16,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:28:16,220 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:28:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:28:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 1 times [2022-04-08 08:28:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:28:16,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1292847104] [2022-04-08 08:28:16,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:28:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 2 times [2022-04-08 08:28:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:28:16,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396224729] [2022-04-08 08:28:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:28:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:28:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:28:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:28:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:28:16,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {718943#(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(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {718937#true} call ULTIMATE.init(); {718943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:28:16,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {718943#(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(18, 2);call #Ultimate.allocInit(12, 3); {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {718937#true} assume true; {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718937#true} {718937#true} #285#return; {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {718937#true} call #t~ret20 := main(); {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {718937#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {718937#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {718937#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {718937#true} is VALID [2022-04-08 08:28:16,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {718937#true} assume !(0 != ~p1~0); {718937#true} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {718937#true} assume !(0 != ~p2~0); {718937#true} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {718937#true} assume !(0 != ~p3~0); {718937#true} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {718937#true} assume !(0 != ~p4~0); {718937#true} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {718937#true} assume !(0 != ~p5~0); {718937#true} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {718937#true} assume !(0 != ~p6~0); {718937#true} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {718937#true} assume !(0 != ~p7~0); {718937#true} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {718937#true} assume !(0 != ~p8~0); {718937#true} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {718937#true} assume 0 != ~p9~0;~lk9~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {718942#(not (= main_~p9~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {718942#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:28:16,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {718942#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {718938#false} is VALID [2022-04-08 08:28:16,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {718938#false} assume 0 != ~p10~0; {718938#false} is VALID [2022-04-08 08:28:16,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {718938#false} assume 1 != ~lk10~0; {718938#false} is VALID [2022-04-08 08:28:16,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {718938#false} assume !false; {718938#false} is VALID [2022-04-08 08:28:16,268 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:28:16,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:28:16,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396224729] [2022-04-08 08:28:16,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396224729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:28:16,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:28:16,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:28:16,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:28:16,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1292847104] [2022-04-08 08:28:16,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1292847104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:28:16,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:28:16,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:28:16,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788496306] [2022-04-08 08:28:16,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:28:16,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 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 35 [2022-04-08 08:28:16,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:28:16,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have 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:28:16,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:28:16,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:28:16,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:28:16,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:28:16,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:28:16,291 INFO L87 Difference]: Start difference. First operand 22025 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have 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:29:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:29:49,340 INFO L93 Difference]: Finished difference Result 33037 states and 48649 transitions. [2022-04-08 08:29:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:29:49,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 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 35 [2022-04-08 08:29:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:29:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have 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:29:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-08 08:29:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have 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:29:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-08 08:29:49,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-08 08:29:49,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:30:08,756 INFO L225 Difference]: With dead ends: 33037 [2022-04-08 08:30:08,756 INFO L226 Difference]: Without dead ends: 22283 [2022-04-08 08:30:08,771 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:30:08,772 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:30:08,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 139 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:30:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2022-04-08 08:30:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2022-04-08 08:30:10,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:30:10,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have 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:30:10,837 INFO L74 IsIncluded]: Start isIncluded. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have 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:30:10,862 INFO L87 Difference]: Start difference. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have 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:30:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:30:23,610 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-08 08:30:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-08 08:30:23,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:30:23,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:30:23,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 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 22283 states. [2022-04-08 08:30:23,676 INFO L87 Difference]: Start difference. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 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 22283 states. [2022-04-08 08:30:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:30:36,351 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-08 08:30:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-08 08:30:36,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:30:36,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:30:36,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:30:36,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:30:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have 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:30:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 32519 transitions. [2022-04-08 08:30:57,807 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 32519 transitions. Word has length 35 [2022-04-08 08:30:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:30:57,808 INFO L478 AbstractCegarLoop]: Abstraction has 22281 states and 32519 transitions. [2022-04-08 08:30:57,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have 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:30:57,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22281 states and 32519 transitions. [2022-04-08 08:31:33,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32519 edges. 32519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 22281 states and 32519 transitions. [2022-04-08 08:31:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 08:31:33,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:33,486 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, 1, 1, 1, 1, 1] [2022-04-08 08:31:33,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:31:33,486 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash -224944604, now seen corresponding path program 1 times [2022-04-08 08:31:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:33,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1420781012] [2022-04-08 08:31:33,487 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:31:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash -224944604, now seen corresponding path program 2 times [2022-04-08 08:31:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:31:33,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096688435] [2022-04-08 08:31:33,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:31:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:31:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:31:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:33,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {874157#(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(18, 2);call #Ultimate.allocInit(12, 3); {874151#true} is VALID [2022-04-08 08:31:33,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {874151#true} assume true; {874151#true} is VALID [2022-04-08 08:31:33,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {874151#true} {874151#true} #285#return; {874151#true} is VALID [2022-04-08 08:31:33,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {874151#true} call ULTIMATE.init(); {874157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {874157#(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(18, 2);call #Ultimate.allocInit(12, 3); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {874151#true} assume true; {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {874151#true} {874151#true} #285#return; {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {874151#true} call #t~ret20 := main(); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {874151#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;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {874151#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {874151#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;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {874151#true} assume !(0 != ~p1~0); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {874151#true} assume !(0 != ~p2~0); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {874151#true} assume !(0 != ~p3~0); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {874151#true} assume !(0 != ~p4~0); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {874151#true} assume !(0 != ~p5~0); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {874151#true} assume !(0 != ~p6~0); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {874151#true} assume !(0 != ~p7~0); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {874151#true} assume !(0 != ~p8~0); {874151#true} is VALID [2022-04-08 08:31:33,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {874151#true} assume !(0 != ~p9~0); {874151#true} is VALID [2022-04-08 08:31:33,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {874151#true} assume !(0 != ~p10~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p1~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p2~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p3~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p4~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p5~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p6~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p7~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p8~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {874156#(= main_~p10~0 0)} assume !(0 != ~p9~0); {874156#(= main_~p10~0 0)} is VALID [2022-04-08 08:31:33,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {874156#(= main_~p10~0 0)} assume 0 != ~p10~0; {874152#false} is VALID [2022-04-08 08:31:33,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {874152#false} assume 1 != ~lk10~0; {874152#false} is VALID [2022-04-08 08:31:33,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {874152#false} assume !false; {874152#false} is VALID [2022-04-08 08:31:33,548 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:31:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:31:33,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096688435] [2022-04-08 08:31:33,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096688435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:33,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:33,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:31:33,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:31:33,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1420781012] [2022-04-08 08:31:33,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1420781012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:33,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:33,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:31:33,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022183317] [2022-04-08 08:31:33,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:31:33,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 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 35 [2022-04-08 08:31:33,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:31:33,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have 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:31:33,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:33,569 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:31:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:31:33,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:31:33,570 INFO L87 Difference]: Start difference. First operand 22281 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)